Scheduling with job release dates, delivery times and preemption penalties

DOI10.1016/S0020-0190(01)00251-4zbMath1013.68028MaRDI QIDQ1603554

Zhaohui Liu, Cheng, T. C. Edwin

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00251-4

zbMATH Keywords

scheduling; setup time; approximation scheme; preemption penalty

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets, Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting, The coordination of transportation and batching scheduling, Lower bounds on online deadline scheduling with preemption penalties, Integrated production and outbound distribution scheduling problems with job release dates and deadlines, The crop growth planning problem in vertical farming, Resource constrained project scheduling subject to due dates: preemption permitted with penalty, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Multi-coloring and job-scheduling with assignment and incompatibility costs, A survey of scheduling problems with setup times or costs

Cites Work

• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Some simple scheduling algorithms
• Unnamed Item