Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
From MaRDI portal
Publication:1017464
DOI10.1016/J.COR.2008.12.018zbMath1160.90481OpenAlexW2008180059MaRDI QIDQ1017464
Jose M. Framinan, Paz Perez-Gonzalez
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/23451
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Some efficient heuristic methods for the flow shop sequencing problem
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
- A fast tabu search algorithm for the permutation flow-shop problem
- Machine scheduling with availability constraints
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Current trends in deterministic scheduling
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- A comprehensive review and evaluation of permutation flowshop heuristics
- Scheduling with limited machine availability
- Benchmarks for basic scheduling problems
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- An improved NEH heuristic to minimize makespan in permutation flow shops
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- A note on the influence of missing operations on scheduling problems
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
This page was built for publication: Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
