A dispatching algorithm for parallel machines with rework processes

DOI10.1057/JORS.2008.148MaRDI QIDQ3582643zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 2 September 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2008.148

zbMATH Keywords

dispatching algorithmparallel machinesrework probabilitysequence-dependent setup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An adaptive scheduling algorithm for a parallel machine problem with rework processes
• Dispatching equal-length jobs to parallel machines to maximize throughput
• Parallel-machine scheduling with potential disruption and positional-dependent processing times
• scientific article; zbMATH DE number 6672186
• Parallel machine scheduling with hierarchical and rejection
• Multiprocessor scheduling with machine allotment and parallelism constraints
• On process assignment in parallel computing
• Identical parallel machine rescheduling under complex restrictions
• Fixed-order scheduling on parallel machines
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time

Cited in

(3)

• A rework-based dispatching algorithm for module process in TFT-LCD manufacture
• An adaptive scheduling algorithm for a parallel machine problem with rework processes
• Dispatching problems for parallel machines in the TFT‐LCD assembly process

This page was built for publication: A dispatching algorithm for parallel machines with rework processes

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