Single-machine scheduling problems with generalized preemption

DOI10.1287/IJOC.1080.0273MaRDI QIDQ2901041zbMATH OpenOpenAlexFDO

Authors Arianna Alfieri, Gaia Nicosia, Alessandro Agnetis

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1080.0273

zbMATH Keywords

packing column generationproduction schedulingsequencingsingle machine preemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemption in single machine earliness/tardiness scheduling
• Single machine scheduling to minimize the number of early and tardy jobs
• Preemptive scheduling with release dates, delivery times and sequence independent setup times
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
• Single machine preemptive scheduling with fixed jobs and release dates to minimize the total number of tardy jobs

Cited in

(4)

• Modeling single machine preemptive scheduling problems for computational efficiency
• Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets
• scientific article; zbMATH DE number 1487922 (Why is no real title available?)
• single Machine Preemptive Scheduling With Special Cost Functions¹

This page was built for publication: Single-machine scheduling problems with generalized preemption

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