Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Márton Drótos, T. Kis

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion

Original languageEnglish
Pages (from-to)337-346
Number of pages10
JournalJournal of Scheduling
Volume16
Issue number3
DOIs
Publication statusPublished - Jun 2013

Fingerprint

Scheduling
Polynomials
Polynomial approximation
Hardness
Processing
Delivery time
Objective function
Tardiness
Approximation
Schedule
NP-hard
Deadline
NP-hardness
Single machine scheduling
Polynomial-time algorithm

Keywords

  • Approximation scheme
  • Computational complexity
  • Inventory
  • Job tardiness
  • Machine scheduling

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Engineering(all)
  • Management Science and Operations Research

Cite this

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times. / Drótos, Márton; Kis, T.

In: Journal of Scheduling, Vol. 16, No. 3, 06.2013, p. 337-346.

Research output: Contribution to journalArticle

@article{2f16e596067c47b5922fa0b516303215,
title = "Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times",
abstract = "In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion",
keywords = "Approximation scheme, Computational complexity, Inventory, Job tardiness, Machine scheduling",
author = "M{\'a}rton Dr{\'o}tos and T. Kis",
year = "2013",
month = "6",
doi = "10.1007/s10951-012-0297-6",
language = "English",
volume = "16",
pages = "337--346",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

AU - Drótos, Márton

AU - Kis, T.

PY - 2013/6

Y1 - 2013/6

N2 - In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion

AB - In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion

KW - Approximation scheme

KW - Computational complexity

KW - Inventory

KW - Job tardiness

KW - Machine scheduling

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

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

U2 - 10.1007/s10951-012-0297-6

DO - 10.1007/s10951-012-0297-6

M3 - Article

AN - SCOPUS:84880712689

VL - 16

SP - 337

EP - 346

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 3

ER -