Tabu search algorithms to minimize the total tardiness in a flow shop production and outbound distribution scheduling problem - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
articleIESM_2015v2_QCT_JCB_JLB_v7.pdf (128.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01245919 , version 1 (07-02-2018)

Identifiers

  • HAL Id : hal-01245919 , version 1

Cite

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⟩
51 View
423 Download

Share

Gmail Facebook Twitter LinkedIn More