Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem

Abstract : —In this paper, we consider a production and out-bound distribution scheduling problem, coming from a real life problem in a chemotherapy production center. Only one vehicle with infinite capacity is available for delivery. The production workshop is an m-machine flow shop. To each job is associated a processing time per machine, a location site and a delivery due date. The travel times are known. The problem is to define a production schedule, batches of jobs, and delivery routes for each batch, so that the sum of tardiness is minimized. Heuristic algorithms are proposed and evaluated on random data sets.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal-univ-tours.archives-ouvertes.fr/hal-01245919
Contributor : Jean-Charles Billaut <>
Submitted on : Wednesday, February 7, 2018 - 3:31:56 PM
Last modification on : Tuesday, July 2, 2019 - 4:02:03 PM
Long-term archiving on : Saturday, May 5, 2018 - 1:40:52 AM

File

articleIESM_2015v2_QCT_JCB_JLB...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01245919, version 1

Citation

Quang Chieu Ta, Jean-Charles Billaut, Jean-Louis Bouquard. Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem. International Conference on Industrial Engineering and Systems Management (IESM’2015), Oct 2015, Seville, Spain. ⟨hal-01245919⟩

Share

Metrics

Record views

48

Files downloads

181