EconPapers    
Economics at your fingertips  
 

Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost

Ali Kordmostafapour (), Javad Rezaeian (), Iraj Mahdavi () and Mahdi Yar Farjad ()
Additional contact information
Ali Kordmostafapour: Mazandaran University of Science and Technology
Javad Rezaeian: Mazandaran University of Science and Technology
Iraj Mahdavi: Mazandaran University of Science and Technology
Mahdi Yar Farjad: Mazandaran University of Science and Technology

OPSEARCH, 2022, vol. 59, issue 4, No 10, 1438-1470

Abstract: Abstract In this study, the unrelated parallel machine scheduling problem where the processing time of jobs is controllable based on resource allocation is considered which the completed jobs are delivered in batches with unlimited batch capacity. A new mathematical model is presented for minimizing the total weighted penalties of tardiness and earliness, resource allocation, and batch delivery costs with idle time and machine elegibility constraints. Three developed metaheuristic algorithms including modified ant colony optimization (MACO) with multi-dimensional pheromone, genetic algorithm (GA) with improved operators and a hybrid algorithm based on hybridization of two the GA and MACO algorithms are proposed to solve the problem. Also, a heuristic and a dynamic programming algorithm are provided to insert idle time and to divide jobs into batches. Finally, the proposed methodologies are compared to each other, computational results shown that the hybrid algorithm could find solutions better than two other algorithms in relatively longer computation time.

Keywords: Unrelated parallel machine; Multi-mode processing time; Batch delivery; Just-in-Time; Total tardiness and total earliness (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-022-00587-z 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:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00587-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-022-00587-z

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

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

 
Page updated 2025-03-20
Handle: RePEc:spr:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00587-z