On the exact solution of the no-wait flow shop problem with due date constraints
DOI10.1016/j.cor.2016.12.013zbMath1391.90312OpenAlexW2562149778WikidataQ56524103 ScholiaQ56524103MaRDI QIDQ1652232
Hamed Samarghandi, Mehdi Behroozi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10388/11495
mixed integer programmingconstraint programmingenumeration algorithmno-wait flow shopdue date constraints
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Cites Work
- Unnamed Item
- Some heuristics for no-wait flowshops with total tardiness criterion
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Evaluation of mathematical models for flexible job-shop scheduling problems
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Sequencing of jobs in some production system
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- The two-machine flow-shop problem with weighted late work criterion and common due date
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- No-wait flow shop scheduling using fuzzy multi-objective linear programming
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Minimizing total tardiness in no-wait flowshops
- A study of integer programming formulations for scheduling problems
- Some new results in flow shop scheduling
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Solutions to the Constrained Flowshop Sequencing Problem
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- The Schedule-Sequencing Problem
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
This page was built for publication: On the exact solution of the no-wait flow shop problem with due date constraints
