Job Shop Scheduling with Unit Processing Times
From MaRDI portal
Publication:5387985
DOI10.1287/moor.1060.0189zbMath1278.90140OpenAlexW2134833035MaRDI QIDQ5387985
Nikhil Bansal, M. I. Sviridenko, Tracy Kimbrel
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1060.0189
Related Items
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Single machine scheduling with two competing agents and equal job processing times, Equitable scheduling on a single machine, Scheduling Problems over Network of Machines, High-multiplicity cyclic job shop scheduling, Scheduling problems over a network of machines, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion