The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
Summary: We consider the makespan minimization in a flowshop environment where the job sequence does not have to be the same for all the machines. Contrarily to the classical permutation flowshop scheduling problem, this strongly NP-hard problem received very scant attention in the literature. In this paper, some improved single-machine-based adjustment procedures are proposed, and a new two-machine-based one is introduced. Based on these adjustments, new lower and upper bounding schemes are derived. Our experimental analysis shows that the proposed procedures provide promising results.
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- A computational study of the permutation flow shop problem based on a tight lower bound
- On non-permutation solutions to some two machine flow shop scheduling problems
- Permutation vs. non-permutation flow shop schedules
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A branch and bound algorithm for the job-shop scheduling problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- A branch-and-bound-based local search method for the flow shop problem
- A class of extremum problems related to agency models with imperfect monitoring
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A modified shifting bottleneck procedure for job-shop scheduling
- A note on permutation flow shop problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- An Algorithm for Solving the Job-Shop Problem
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- An improved shifting bottleneck procedure for the job shop scheduling problem
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 1319608 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- On the complexity of two machine job-shop scheduling with regular objective functions
- On two-machine scheduling with release and due dates to minimize maximum lateness
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Permutation vs. non-permutation flow shop schedules
- Shop Problems With Two Machines and Time Lags
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- The Complexity of Flowshop and Jobshop Scheduling
- The job-shop problem and immediate selection
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- The one-machine sequencing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Two branch and bound algorithms for the permutation flow shop problem
This page was built for publication: The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336283)
