A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
From MaRDI portal
Publication:2029256
DOI10.1016/j.ejor.2019.07.055zbMath1487.90318OpenAlexW2966696224MaRDI QIDQ2029256
Mariano Frutos, Martín D. Safe, Daniel A. Rossit, Fernando A. Tohmé, Oscar C. Vásquez
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.055
makespancritical pathnon-permutation flow shop scheduling problemstructural and dominance propertiesunknown processing times
Related Items
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine ⋮ A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect ⋮ Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
Cites Work
- Unnamed Item
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Synchronous flow shop scheduling with pliable jobs
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Permutation vs. non-permutation flow shop schedules
- A fast tabu search algorithm for the permutation flow-shop problem
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Learning curve parameter estimation beyond traditional statistics
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- A survey of scheduling with controllable processing times
- Optimal two- and three-stage production schedules with setup times included
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
- Critical-Path Planning and Scheduling: Mathematical Basis
- Solution of the Akers-Friedman Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Non-Numerical Approach to Production Scheduling Problems
- Scheduling
- Tight Bounds for Permutation Flow Shop Scheduling
