In the United States, right‐to‐work (RTW) laws impose open shop on labour unions. I test whether RTW affects frequency and outcomes of union representation petitions. Quasi‐experimental tests reveal no association between law volume certification petitions filed that fewer are withdrawn under RTW. Thus, unions do not appear to retreat from new member organizing law. Moreover, correlates with a ...

Open Shop is a classical scheduling problem: given a set J of jobs and a setM of machines, find a minimum-makespan schedule to process each job Ji ∈ J on each machine Mq ∈ M for a given amount piq of time such that each machine processes only one job at a time and each job is processed by only one machine at a time. In Routing Open Shop, the jobs are located in the vertices of an edge-weighted ...

An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.

Ideal schedules minimize both maximum completion time and total completion time of jobs. This paper presents polynomial-time algorithms finding ideal nonpreemptive and preemptive two-machine schedules of jobs with arbitrary release dates and precedence constraints and unit-execution-time operations on identical parallel machines, in a flow shop and an open shop. Heretofore, the complexity statu...