Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem

DOI10.1016/J.COR.2004.11.004MaRDI QIDQ1781577zbMATH OpenOpenAlexFDO

Authors Bing Wang, Yugeng Xi, Hanyu Gu

Publication date 27 June 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.11.004

zbMATH Keywords

Initial scheduleLocal schedulingRolling horizon proceduresTerminal penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• A hybrid heuristic approach for single machine scheduling with release times
• scientific article; zbMATH DE number 40475

Cites work

• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Efficient heuristics to minimize total flow time with release dates
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 91757 (Why is no real title available?)
• On n/1/?? dynamic deterministic problems
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic

Cited in

(2)

• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• Improved rolling horizon approaches to the aircraft sequencing problem

This page was built for publication: Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem

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