Parallel machine scheduling with preference of machines

DOI10.1080/00207540902991674MaRDI QIDQ3163231zbMATH OpenOpenAlexFDO

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

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

hungarian methodparallel machinespreference of machinesscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel machines scheduling with machine preference via agent-based approach
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• scientific article; zbMATH DE number 4085393
• scientific article; zbMATH DE number 1208137
• Unknown Input Observers Designed by Eigenstructure Assignment

Cites work

• 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
• A state-of-the-art review of parallel-machine scheduling research
• A survey of scheduling problems with setup times or costs
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• Minimizing the sum of job earliness and tardiness in a multimachine system
• Scheduling parallel machines to minimize weighted flowtime with family set-up times

Cited in

(4)

• Parallel dedicated machines scheduling with chain precedence constraints
• Parallel machines scheduling with machine preference via agent-based approach
• Unknown Input Observers Designed by Eigenstructure Assignment
• Parallel Machine Scheduling: Impact of Adding Extra Machines

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

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