Dynamic non-preemptive single machine scheduling
From MaRDI portal
Publication:1360133
DOI10.1016/S0305-0548(96)00025-1zbMATH Open0876.90059OpenAlexW2016749971MaRDI QIDQ1360133FDOQ1360133
Sri V. Sridharan, Zhuoqun Zhou
Publication date: 15 July 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00025-1
Cites Work
- Title not available (Why is that?)
- A survey of priority rule-based scheduling
- Algorithms for Solving Production-Scheduling Problems
- Tactically delayed versus non-delay scheduling: An experimental investigation
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
Cited In (6)
- Dynamic single-machine scheduling under distributed decision-making
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Jackson's semi-preemptive scheduling on a single machine
- New heuristics for total tardiness minimization in a flexible flowshop
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
Recommendations
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems 👍 👎
- Dynamic scheduling of stochastic jobs on a single machine 👍 👎
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectives 👍 👎
- An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs 👍 👎
- A dynamic programming method for single machine scheduling 👍 👎
This page was built for publication: Dynamic non-preemptive single machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360133)
