Rescheduling strategies for minimizing total weighted tardiness in complex job shops

DOI10.1081/00207540310001614132zbMath1176.90230OpenAlexW2065185334MaRDI QIDQ4826251

No author found.

Publication date: 11 November 2004

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

Full work available at URL: https://doi.org/10.1081/00207540310001614132

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (11)

Risk measure of job shop scheduling with random machine breakdowns ⋮ Optimizing makespan and stability risks in job shop scheduling ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ Integrated process planning and scheduling/rescheduling—an agent-based approach ⋮ A generic deadlock-free reactive scheduling approach ⋮ Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops ⋮ A survey of scheduling with parallel batch (p-batch) processing

This page was built for publication: Rescheduling strategies for minimizing total weighted tardiness in complex job shops