Tactically delayed versus non-delay scheduling: An experimental investigation

DOI10.1016/0377-2217(86)90015-9MaRDI QIDQ1068706zbMATH OpenOpenAlexFDO

Authors John J. Kanet

Publication date 1986

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(86)90015-9

zbMATH Keywords

single-machine problemstactically delayed scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic non-preemptive single machine scheduling
• Performance analysis of active schedules in identical parallel machine
• Scheduling job shops with delays
• An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
• On single-machine scheduling without intermediate delays

Cited in

(8)

• On-line two-machine open shop scheduling with time lags
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• A note: minimizing maximum earliness on a proportionate flowshop
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• On-line two-machine job shop scheduling with time lags
• Dynamic non-preemptive single machine scheduling
• Multiple train repositioning operations in a railyard network

This page was built for publication: Tactically delayed versus non-delay scheduling: An experimental investigation

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