Abstract

We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.

Original languageEnglish (US)
Pages (from-to)511-537
Number of pages27
JournalJournal of Heuristics
Volume20
Issue number5
DOIs
StatePublished - 2014

Fingerprint

Parallel Machine Scheduling
Parallel Machines
Scheduling Problem
Scheduling
Total Weighted Completion Time
Flow Shop
Supply Chain
Mathematical Modeling
Supply chains
Batch
Customers
Heuristics
Unit
Costs
Parallel machine scheduling
Parallel machines
Integrated production
Flow shop
Mathematical modeling
Supply chain

Keywords

  • Greedy heuristics
  • Local search
  • Mathematical modeling
  • Supply chain scheduling

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Computer Networks and Communications
  • Information Systems
  • Control and Optimization
  • Management Science and Operations Research

Cite this

Scheduling parallel machines with single vehicle delivery. / Cakici, Eray; Mason, Scott J.; Geismar, H. Neil; Fowler, John.

In: Journal of Heuristics, Vol. 20, No. 5, 2014, p. 511-537.

Research output: Contribution to journalArticle

Cakici, Eray ; Mason, Scott J. ; Geismar, H. Neil ; Fowler, John. / Scheduling parallel machines with single vehicle delivery. In: Journal of Heuristics. 2014 ; Vol. 20, No. 5. pp. 511-537.
@article{fdc290f4c9f1433581a61c41b65e54e6,
title = "Scheduling parallel machines with single vehicle delivery",
abstract = "We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.",
keywords = "Greedy heuristics, Local search, Mathematical modeling, Supply chain scheduling",
author = "Eray Cakici and Mason, {Scott J.} and Geismar, {H. Neil} and John Fowler",
year = "2014",
doi = "10.1007/s10732-014-9249-y",
language = "English (US)",
volume = "20",
pages = "511--537",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer Netherlands",
number = "5",

}

TY - JOUR

T1 - Scheduling parallel machines with single vehicle delivery

AU - Cakici, Eray

AU - Mason, Scott J.

AU - Geismar, H. Neil

AU - Fowler, John

PY - 2014

Y1 - 2014

N2 - We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.

AB - We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.

KW - Greedy heuristics

KW - Local search

KW - Mathematical modeling

KW - Supply chain scheduling

UR - http://www.scopus.com/inward/record.url?scp=84919877555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919877555&partnerID=8YFLogxK

U2 - 10.1007/s10732-014-9249-y

DO - 10.1007/s10732-014-9249-y

M3 - Article

AN - SCOPUS:84919877555

VL - 20

SP - 511

EP - 537

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

IS - 5

ER -