Loading...
Loading...

Go to the content (press return)

An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem

Author
Ribas, I.; Companys, R.; Tort, X.
Type of activity
Journal article
Journal
Expert systems with applications
Date of publication
2019-05-01
Volume
121
First page
347
Last page
361
DOI
https://doi.org/10.1016/j.eswa.2018.12.039 Open in new window
Repository
http://hdl.handle.net/2117/127883 Open in new window
URL
https://www.sciencedirect.com/science/article/pii/S0957417418308078 Open in new window
Abstract
This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the blockage of machines if a job has finished its operation and the next machine is not available. The criterion considered is the minimization of the sum of tardiness of all the jobs to schedule, i.e., minimization of the total tardiness of jobs. Notice that the proposed method is ...
Citation
Ribas, I.; Companys , R.; Tort, X. An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. "Expert systems with applications", 1 Maig 2019, vol. 121, p. 347-361.
Keywords
Blocking, Distribution flow shop, Parallel flow shop, Scheduling Total tardiness
Group of research
SCOM - Supply Chain and Operations Management

Participants