A survey of scheduling problems with no-wait in process

Allahverdi, Ali

doi:10.1016/j.ejor.2016.05.036

Cited by 162 publications

(79 citation statements)

References 213 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, if we consider the special case of a MinMax‐COVRP, where all customers must be visited on the same route, then we can model the problem as an asymmetric TSP, which has a close relation to no‐wait flowshops with a makespan objective. We refer the reader to Allahverdi () for a recent survey about no‐wait scheduling problems.…”

Section: Related Literaturementioning

confidence: 99%

A matheuristic for the MinMax capacitated open vehicle routing problem

Lysgaard

López-Sánchez

Hernández-Díaz

2018

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, the MinMax‐COVRP (where COVRP is capacitated open vehicle routing problem) is considered as a variation of the COVRP where the objective is to minimize the duration of the longest route. For the purpose of producing high‐quality solutions, elements from the fields of mathematical programming and metaheuristics are combined, resulting in a matheuristic for solving the MinMax‐COVRP. The matheuristic benefits from the diversification produced by a metaheuristic and the intensification from mixed‐integer linear programming (MILP). The initial solution provided by a multistart heuristic is used to seed and accelerate the MILP in which a local branching framework and the separation of k‐path inequalities are suitably combined. Computational experience shows promising results not only improving the initial solution provided by the multistart algorithm, but also ensuring optimality for most of the small‐ and medium‐sized instances.

show abstract

Section: Related Literaturementioning

confidence: 99%

A matheuristic for the MinMax capacitated open vehicle routing problem

Lysgaard

López-Sánchez

Hernández-Díaz

2018

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…According to Graham's notation, this problem belongs to the F m /no − wait/C max class. A good survey about no-wait flowshop scheduling problems is the one by Allahverdi [1].…”

Section: Introductionmentioning

confidence: 99%

Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations

García-Mata

Márquez-Gutiérrez

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Planning and scheduling have been a central theme of research in computer science. In particular, the simplicity of the theoretical approach of a no-wait flowshop scheduling problem does not allow to perceive the problem's complexity at first sight. In this paper the applicability of the Answer Set Programming language is explored for the solution of the Automated Wet-etching scheduling problem in Semiconductor Manufacturing Systems. A method based in ranges is proposed in order to reduce the huge number of combinations.

show abstract

“…Specially, planning and scheduling of multiproduct multistage batch plants has been extensively studied in the past for many authors in many different applications and a large number of contributions and approaches have been developed to tackle this kind of problems. Most of the applications and approaches have been developed using mixed integer programming techniques and suitable literature reviews can be found in literature [12][13][14][15][16] , and more recent work [17][18][19] . On the other hand, the planning and scheduling problem of multiproduct continuous plants has received less attention in the literature despite its practical importance in the chemical process industries 20 .…”

Section: Introductionmentioning

confidence: 99%

Mixed Integer Linear Programming Based Approaches for Medium-Term Planning and Scheduling in Multiproduct Multistage Continuous Plants

Aguirre

Liu

Papageorgiou

2017

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

This paper addresses the planning and scheduling problem of a multiproduct multistage continuous plant by three novel MILP-based (Mixed Integer Linear Programming) models. These models combine a TSP (Traveling Salesman Problem) formulation with the main ideas of general precedence and unit-specific general precedence concepts to provide hybrid discrete/continuous time representations of the system. Also, an efficient solution approach involving rolling horizon and iterative-improvement algorithm is derived for solving mediumsize instances of the problem. Results analyses for different model's parameters demonstrate the benefits of the new formulations and the effectiveness of the solution approach presented in this work.

show abstract

A survey of scheduling problems with no-wait in process

Cited by 162 publications

References 213 publications

A matheuristic for the MinMax capacitated open vehicle routing problem

A matheuristic for the MinMax capacitated open vehicle routing problem

Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations

Mixed Integer Linear Programming Based Approaches for Medium-Term Planning and Scheduling in Multiproduct Multistage Continuous Plants

Contact Info

Product

Resources

About