Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
From MaRDI portal
Publication:5466727
DOI10.1080/00207540500050071zbMath1068.90056OpenAlexW2065192513MaRDI QIDQ5466727
Seong-Woo Choi, Geun-Cheol Lee, Yeong-Dae Kim
Publication date: 25 August 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500050071
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
Machine scheduling in underground mining: an application in the potash industry ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Scheduling with divisible jobs and subcontracting option ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ 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 ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem
Cites Work
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- A heuristic algorithm for two-machine re-entrant shop scheduling
- Heuristics for scheduling in a flow shop with multiple processors
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Minimizing Makespan in a Class of Reentrant Shops
- Bottleneck-focused scheduling for a hybrid flowshop
- Minimizing makespan in re-entrant permutation flow-shops
- A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
This page was built for publication: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
