EconPapers    
Economics at your fingertips  
 

A new exact algorithm for no-wait job shop problem to minimize makespan

A. Ozolins ()
Additional contact information
A. Ozolins: University of Latvia

Operational Research, 2020, vol. 20, issue 4, No 18, 2333-2363

Abstract: Abstract In this paper, the no-wait job shop scheduling problem with a makespan objective is considered. A new exact algorithm, which is based on the dynamic programming (DP), is proposed. We introduce a dominance relation between two timetables. Several theorems are provided showing the application of the dominance. Despite the theoretical interest, experimental results prove that the proposed algorithm is able to optimally solve moderate benchmark instances within a reasonable time limit. Moreover, we have shown that the use of the dominance effectively reduces the state space of the algorithm. As an extension of the DP algorithm, we also present its heuristic version. It is shown that good quality upper bounds for large-size benchmark instances can be obtained. A comparison among several algorithms presented in the literature shows that the DP algorithm is quite competitive in terms of the computational time and the quality of obtained solutions.

Keywords: Job shop; No-wait; Makespan; Dynamic programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-018-0414-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:20:y:2020:i:4:d:10.1007_s12351-018-0414-1

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-018-0414-1

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:operea:v:20:y:2020:i:4:d:10.1007_s12351-018-0414-1