Oligopoly, open shop unions and trade liberalisation

In an international oligopoly model, we investigate how trade liberalisation impacts on collective bargaining outcomes when workers are represented by open shop unions. We find that, with intermediate levels of union density, trade liberalisation may lead to higher negotiated wages even if no trade occurs in equilibrium. In addition, we show that union wages may be higher with free trade than in autarky.International oligopoly, bargaining, open shop unions, trade liberalisation

Alternatif Pemecahan Masalah Open Shop Schedulling Dengan Pendekatan Algoritma Genetik Dan Heuristik

One of industrial problem is Open Shop Schedulling (OSS). This research try topropose open shop schedulling problem alternative solution with genetic and heuristicapproach. First we try to make a genetic coding for this problem. Machine schedulling systemanalogue as individu, chromosom analogue as a machine (task), and gen analogue as theoperation. Each individu consist of chromosoms, and each chromosom consist of gens. Weused two methods which represented by coding by operation and code task-operation. Afterchromosom coding detected, fitness function can determine the function of givingchromosoms weight to choose parent chromosom and changing population. Fitness functiondesign base on minimum sum of zero time on each machine with high efficiency, and lack ofoverlapping job for each machine

The Open Shop Scheduling Problem

We discuss the computational complexity, the approximability, the algorithmics and the combinatorics of the open shop scheduling problem. We summarize the most important results from the literature and explain their main ideas, we sketch the most beautiful proofs, and we also list a number of open problems

Open Shop Scheduling with Synchronization

In this paper, we study open shop scheduling problems with synchronization. This model has the same features as the classical open shop model, where each of the n jobs has to be processed by each of the m machines in an arbitrary order. Unlike the classical model, jobs are processed in synchronous cycles, which means that the m operations of the same cycle start at the same time. Within one cycle, machines which process operations with smaller processing times have to wait until the longest operation of the cycle is finished before the next cycle can start. Thus, the length of a cycle is equal to the maximum processing time of its operations. In this paper, we continue the line of research started by Weiß et al. (Discrete Appl Math 211:183–203, 2016). We establish new structural results for the two-machine problem with the makespan objective and use them to formulate an easier solution algorithm. Other versions of the problem, with the total completion time objective and those which involve due dates or deadlines, turn out to be NP-hard in the strong sense, even for m=2 machines. We also show that relaxed models, in which cycles are allowed to contain less than m jobs, have the same complexity status

The Open Shop, Number Nine

https://digitalcommons.unomaha.edu/ascdigitizedbooks/1006/thumbnail.jp

The Open Shop, Number Ten

https://digitalcommons.unomaha.edu/ascdigitizedbooks/1007/thumbnail.jp