Scheduling with job release dates, delivery times and preemption penalties

DOI10.1016/S0020-0190(01)00251-4MaRDI QIDQ1603554zbMATH OpenOpenAlexFDO

Authors Zhaohui Liu, T. C. Edwin Cheng

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

schedulingsetup timeapproximation schemepreemption penalty

Mathematics Subject Classification ID

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

Recommendations

• Preemptive scheduling with release dates, delivery times and sequence independent setup times
• Minimizing total completion time subject to job release dates and preemption penalties
• Automated performance modeling of software generated by a design environment
• How useful are preemptive schedules?
• Modeling single machine preemptive scheduling problems for computational efficiency

Cites work

• scientific article; zbMATH DE number 1305470 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Some simple scheduling algorithms
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

Cited in

(13)

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

This page was built for publication: Scheduling with job release dates, delivery times and preemption penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603554)