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

DOI10.1080/00207540802043998zbMath1198.90204OpenAlexW2069336936WikidataQ58644694 ScholiaQ58644694MaRDI QIDQ3055296

Azizoglu, Meral, Melih Özlen

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

zbMATH Keywords

efficient solutionsbranch and bound algorithmrescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

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

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