Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

DOI10.1080/00207540802043998zbMATH Open1198.90204OpenAlexW2069336936WikidataQ58644694 ScholiaQ58644694MaRDI QIDQ3055296FDOQ3055296

Authors: Melih Özlen, Meral Azizoğlu 

Publication date: 7 November 2010

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

Full work available at URL: https://hdl.handle.net/11511/49240

Recommendations

• Rescheduling of identical parallel machines under machine eligibility constraints.
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• Identical parallel machine rescheduling under complex restrictions
• Pareto optimizations for rescheduling problems

zbMATH Keywords

efficient solutionsbranch and bound algorithmrescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
• Identical parallel machine rescheduling under complex restrictions
• Rescheduling of identical parallel machines under machine eligibility constraints.

This page was built for publication: Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

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