scientific article
From MaRDI portal
zbMath0452.90035MaRDI QIDQ3899811
Alexander H. G. Rinnooy Kan, B. J. Lageweg, Eugene L. Lawler, Jan Karel Lenstra
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
The shortest first coordination mechanism for a scheduling game with parallel-batching machines, On the complexity of preemptive openshop scheduling problems, Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time, A classification scheme for vehicle routing and scheduling problems, Reducibility among single machine weighted completion time scheduling problems, An appraisal of computational complexity for operations researchers, A coordination mechanism for a scheduling game with parallel-batching machines, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Scheduling batch processing machines with incompatible job families, Unnamed Item, A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Scheduling chain-structured tasks to minimize makespan and mean flow time, New directions in scheduling theory, Scheduling subject to resource constraints: Classification and complexity, On the complexity of preemptive open-shop scheduling problems, Complexity of single machine, multi-criteria scheduling problems, Constructive heuristic algorithms for the open shop problem, Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times, A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem], Minimizing the number of late jobs on unrelated machines
