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

DOI10.1016/j.cor.2004.11.004zbMath1090.90094OpenAlexW2071122851MaRDI QIDQ1781577

Bing Wang, Han-Yu Gu, Yu-Geng Xi

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)

Related Items (1)

Improved rolling horizon approaches to the aircraft sequencing problem

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Efficient heuristics to minimize total flow time with release dates
• Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• On n/1/?? dynamic deterministic problems
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

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