Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines

DOI10.1080/00207540701352102MaRDI QIDQ3605446zbMATHOpenAlexFDO

Authors Chun-Lung Chen, Chuen-Lung S. Chen

Publication date 24 February 2009

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

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

zbMATH Keywords

unrelated parallel machinesflexible flow linebottleneck-based heuristics

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
• New heuristics for total tardiness minimization in a flexible flowshop
• Bottleneck-focused scheduling for a hybrid flowshop
• scientific article; zbMATH DE number 1594555
• Scheduling jobs on a \(k\)-stage flexible flow-shop

Cites work

• A comparison of sequencing rules in static and dynamic hybrid flow systems
• A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
• A flexible flowshop problem with total flow time minimization
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
• Bottleneck-focused scheduling for a hybrid flowshop
• Global lower bounds for flow shops with multiple processors
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study

Cited in

(5)

• scientific article; zbMATH DE number 1594555 (Why is no real title available?)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
• The hybrid flow shop scheduling problem
• Bottleneck-focused scheduling for a hybrid flowshop
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM

This page was built for publication: Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines

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