Identical parallel machine rescheduling under complex restrictions

MaRDI QIDQ5371426zbMATH OpenFDO

Authors Ao Liu, Mengni Zhu, Yongliang Luo, Ke Liu, Bo Liu

Publication date 20 October 2017

zbMATH Keywords

identical parallel machine schedulingjob release timemachine available timemachine eligibility restrictionspriority rule

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• Rescheduling of identical parallel machines under machine eligibility constraints.
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• Generating all efficient solutions of a rescheduling problem on unrelated parallel machines
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions

Cited in

(6)

• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Rescheduling of identical parallel machines under machine eligibility constraints.
• Scheduling identical parallel machines with tooling constraints
• Generating all efficient solutions of a rescheduling problem on unrelated parallel machines
• A dispatching algorithm for parallel machines with rework processes
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules

This page was built for publication: Identical parallel machine rescheduling under complex restrictions

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