Scheduling on a bottleneck station: A comprehensive cost model and heuristic algorithms

DOI10.1080/002075497195515zbMATH Open0940.90544OpenAlexW2132396708MaRDI QIDQ4245253FDOQ4245253

Authors:

Publication date: 15 September 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075497195515

Recommendations

• Mathematical Modeling of Scheduling Problems
• Scheduling with variable time slot costs
• Scheduling N Products On A Single Facility With Back-Ordering And Eixed Terminal Inventory
• Single machine scheduling with nonlinear cost functions
• An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cited In (1)

• The battery switching station scheduling problem

This page was built for publication: Scheduling on a bottleneck station: A comprehensive cost model and heuristic algorithms

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