Production and transport scheduling in flexible job shop manufacturing systems

This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 79; číslo 2; s. 463 - 502
Hlavní autoři: Homayouni, Seyed Mahdi, Fontes, Dalila B. M. M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2021
Springer
Springer Nature B.V
Témata:
Computer Science
Integer programming
Job shop scheduling
Job shops
Linear programming
Mathematics
Mathematics and Statistics
Mixed integer
Operations Research/Decision Theory
Optimization
Production scheduling
Real Functions
Vehicles
Late acceptance hill climbing
Transport
Mixed integer linear programming model
Flexible job shop
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations for each machine, assigning each transport task to one of the vehicles, and finding the sequence of transport tasks for each vehicle, simultaneously. Transportation is usually neglected in the literature and when considered, an unlimited number of vehicles is, typically, assumed. Here, we propose the first mixed integer linear programming model for this problem and show its efficiency at solving small-sized instances to optimality. In addition, and due to the NP-hard nature of the problem, we propose a local search based heuristic that the computational experiments show to be effective, efficient, and robust.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-021-00992-6