Parallel machine scheduling with preference of machines

DOI10.1080/00207540902991674zbMath1197.90199OpenAlexW2140757765MaRDI QIDQ3163231

Ching-Jong Liao, Chien-Wen Chao, Ming-Chou Chuang

Publication date: 25 October 2010

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

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

zbMATH Keywords

schedulingparallel machineshungarian methodpreference of machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Parallel machines scheduling with machine preference via agent-based approach

Cites Work

• A state-of-the-art review of parallel-machine scheduling research
• A survey of scheduling problems with setup times or costs
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Minimizing the sum of job earliness and tardiness in a multimachine system
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions

This page was built for publication: Parallel machine scheduling with preference of machines