Bottleneck-focused scheduling for a hybrid flowshop

DOI10.1080/00207540310001602892zbMath1052.90559OpenAlexW2103460039MaRDI QIDQ4474711

No author found.

Publication date: 12 July 2004

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ New heuristics for total tardiness minimization in a flexible flowshop ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ The hybrid flow shop scheduling problem ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility ⋮ Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs

Cites Work

• Global lower bounds for flow shops with multiple processors
• A heuristic for the single machine tardiness problem
• Heuristics for scheduling in a flow shop with multiple processors
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• An integrated inventory model for a single product and its raw materials
• A Survey of Scheduling Rules
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• The Total Tardiness Problem: Review and Extensions

This page was built for publication: Bottleneck-focused scheduling for a hybrid flowshop