Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
From MaRDI portal
(Redirected from Publication:1017464)
Recommendations
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Permutation Schedules for Flow Shops with Precedence Constraints
- Heuristics for permutation flow shop scheduling with batch setup times
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Tight Bounds for Permutation Flow Shop Scheduling
- Tight bounds for permutation flow shop scheduling
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- A permutation flow-shop scheduling problem with convex models of operation processing times
Cites work
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop 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
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Benchmarks for basic scheduling problems
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Current trends in deterministic scheduling
- Design and analysis of experiments.
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Due date management policies
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- Machine scheduling with availability constraints
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with limited machine availability
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Two-machine no-wait flow shop scheduling with missing operations
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
Cited in
(5)- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- 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
This page was built for publication: Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017464)
