The job shop tardiness problem: A decomposition approach
From MaRDI portal
Publication:1310711
DOI10.1016/0377-2217(93)90163-HzbMath0783.90055OpenAlexW2154716183MaRDI QIDQ1310711
F. Brian Talbot, Narayan Raman
Publication date: 21 March 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90163-h
manufacturingeffectivenessheuristicdue datesjob shop tardiness problemprioritizing dispatching rules
Related Items (5)
The job shop tardiness problem: A corrected model ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems ⋮ Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
Cites Work
- Real-time scheduling of an automated manufacturing center
- Focused Scheduling in Proportionate Flowshops
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- On general routing problems
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
This page was built for publication: The job shop tardiness problem: A decomposition approach
