Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
From MaRDI portal
Publication:4230171
DOI10.1080/00207549608904988zbMATH Open0927.90033OpenAlexW1984297368MaRDI QIDQ4230171FDOQ4230171
Authors: 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
Recommendations
- Minimizing tardy jobs in a two-stage hybrid flowshop
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- A state-of-the-art review of parallel-machine scheduling research
- Scheduling with deadlines and loss functions
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A survey and evaluation of static flowshop scheduling heuristics
- Title not available (Why is that?)
- Minimizing makespan in hybrid flowshops
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- Flowshop sequencing problems with limited buffer storage
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Scheduling open shops with parallel machines
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- Minimizing maximum lateness in a two-machine unit-time job shop
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
Cited In (36)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
- Capacity-filtering algorithms for finite-capacity planning of a flexible flow line
- A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Bottleneck-focused scheduling for a hybrid flowshop
- Integer programming approach to production scheduling for make-to-order manufacturing
- Flowshop scheduling with identical jobs and uniform parallel machines
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
- Title not available (Why is that?)
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- A taxonomy of flexible flow line scheduling procedures
- The hybrid flow shop scheduling problem
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Title not available (Why is that?)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- A note: minimizing maximum earliness on a proportionate flowshop
- Batch-size-based rearrangement of the shop floor into mini-lines
- A combination of flow shop scheduling and the shortest path problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A genetic algorithm for the proportionate multiprocessor open shop
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Minimizing total completion time for flowshop scheduling problem with uncertain processing times
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Scheduling problems in master-slave model
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and 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 flexible flowshop problem with total flow time minimization
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
This page was built for publication: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230171)
