An adaptive scheduling algorithm for a parallel machine problem with rework processes

DOI10.1080/00207540802484903zbMath1197.90210OpenAlexW2150542788WikidataQ57441413 ScholiaQ57441413MaRDI QIDQ3163785

Hyun Joon Shin, Yongha Kang

Publication date: 26 October 2010

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

Full work available at URL: https://doi.org/10.1080/00207540802484903

zbMATH Keywords

parallel machinesadaptive schedulingdispatching algorithmrework probabilityproblem-space-based search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The third comprehensive survey on scheduling problems with setup times/costs

Cites Work

• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times

This page was built for publication: An adaptive scheduling algorithm for a parallel machine problem with rework processes