Complexity results for scheduling tasks with discrete starting times
From MaRDI portal
Publication:3319772
DOI10.1016/0196-6774(82)90030-XzbMath0535.68017WikidataQ29038484 ScholiaQ29038484MaRDI QIDQ3319772
S. Louis Hakimi, Kazuo Nakajima
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (13)
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards ⋮ Efficient order processing in an inverse order picking system ⋮ Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment ⋮ Parts-to-picker based order processing in a rack-moving mobile robots environment ⋮ Interval scheduling and colorful independent sets ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ On the complexity of scheduling tasks with discrete starting times ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Balanced splitting on weighted intervals ⋮ On the approximability of an interval scheduling problem ⋮ Single machine scheduling with forbidden start times ⋮ Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores ⋮ Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
This page was built for publication: Complexity results for scheduling tasks with discrete starting times
