On the exact solution of the no-wait flow shop problem with due date constraints
type: Item
instance of: scholarly article
title: On the exact solution of the no-wait flow shop problem with due date constraints
zbMATH Open document ID: 1391.90312
author: Hamed Samarghandi
author: Mehdi Behroozi
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: http://hdl.handle.net/10388/11495
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6901380
zbMATH Keywords: no-wait flow shop
zbMATH Keywords: due date constraints
zbMATH Keywords: mixed integer programming
zbMATH Keywords: constraint programming
zbMATH Keywords: enumeration algorithm
MaRDI profile type: Publication
OpenAlex ID: W2562149778
Wikidata QID: Q56524103
cites work: Minimizing total tardiness in no-wait flowshops
cites work: The two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Solutions to the Constrained Flowshop Sequencing Problem
cites work: The Schedule-Sequencing Problem
cites work: Evaluation of mathematical models for flexible job-shop scheduling problems
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
cites work: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
cites work: Sequencing of jobs in some production system
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
cites work: No-wait flow shop scheduling using fuzzy multi-objective linear programming
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Some heuristics for no-wait flowshops with total tardiness criterion
cites work: A study of integer programming formulations for scheduling problems
cites work: Mixed binary integer programming formulations for the reentrant job shop scheduling problem
cites work: An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
cites work: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
cites work: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
cites work: Some new results in flow shop scheduling
cites work: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
cites work: A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
cites work: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
cites work: Q3820362
cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
cites work: Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
DOI: 10.1016/J.COR.2016.12.013
description: scientific article; zbMATH DE number 6901380