Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

DOI10.1080/00207549608904988zbMath0927.90033OpenAlexW1984297368MaRDI QIDQ4230171

A. G. P. Guinet, Marius M. Solomon

Publication date: 13 December 1999

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

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

zbMATH Keywords

identical parallel machinesindependent jobsseveral serial workshops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (29)

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 ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach ⋮ Single-machine scheduling with production and rejection costs to minimize the maximum earliness ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ A note: minimizing maximum earliness on a proportionate flowshop ⋮ Scheduling problems in master-slave model ⋮ A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation ⋮ Integer programming approach to production scheduling for make-to-order manufacturing ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ A flexible flowshop problem with total flow time minimization ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Capacity-filtering algorithms for finite-capacity planning of a flexible flow line ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Steel-making process scheduling using Lagrangian relaxation ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ Bottleneck-focused scheduling for a hybrid flowshop ⋮ Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility ⋮ Flowshop scheduling with identical jobs and uniform parallel machines

Cites Work

• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Some efficient heuristic methods for the flow shop sequencing problem
• A state-of-the-art review of parallel-machine scheduling research
• Minimizing maximum lateness in a two-machine unit-time job shop
• Scheduling open shops with parallel machines
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
• Minimizing makespan in hybrid flowshops
• Scheduling with Deadlines and Loss Functions
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
• Flowshop sequencing problems with limited buffer storage
• Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time