Technical Note: A Simple Model For Optimizing the Single Machine Early/Tardy Problem with Sequence-Dependent Setups

B. Jay Coleman

doi:10.1111/j.1937-5956.1992.tb00354.x

Technical Note: A Simple Model For Optimizing the Single Machine Early/Tardy Problem with Sequence-Dependent Setups

Research output: Contribution to journal › Article › peer-review

Abstract

A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.

Original language	American English
Pages (from-to)	225-228
Number of pages	3
Journal	Production and Operations Management
Volume	1
Issue number	2
DOIs	https://doi.org/10.1111/j.1937-5956.1992.tb00354.x
State	Published - Jun 1992

Keywords

Production/Scheduling
Single Machine
Deterministic Job Shop
Mixed Integer Programming

Disciplines

Economics
Operations and Supply Chain Management

Access to Document

10.1111/j.1937-5956.1992.tb00354.xLicense: Unspecified

Cite this

@article{a9a273cfab9a4251bce66a5e192d811d,

title = "Technical Note: A Simple Model For Optimizing the Single Machine Early/Tardy Problem with Sequence-Dependent Setups",

abstract = "A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.",

keywords = "Production/Scheduling, Single Machine, Deterministic Job Shop, Mixed Integer Programming",

author = "Coleman, {B. Jay}",

note = "COLEMAN, B. J. (1992). TECHNICAL NOTE: A SIMPLE MODEL FOR OPTIMIZING THE SINGLE MACHINE EARLY/TARDY PROBLEM WITH SEQUENCE‐DEPENDENT SETUPS. Production and Operations Management, 1(2), 225-228. https://doi.org/10.1111/j.1937-5956.1992.tb00354.x",

year = "1992",

month = jun,

doi = "10.1111/j.1937-5956.1992.tb00354.x",

language = "American English",

volume = "1",

pages = "225--228",

journal = "Production and Operations Management",

issn = "1059-1478",

number = "2",

}

TY - JOUR

T1 - Technical Note

T2 - A Simple Model For Optimizing the Single Machine Early/Tardy Problem with Sequence-Dependent Setups

AU - Coleman, B. Jay

N1 - COLEMAN, B. J. (1992). TECHNICAL NOTE: A SIMPLE MODEL FOR OPTIMIZING THE SINGLE MACHINE EARLY/TARDY PROBLEM WITH SEQUENCE‐DEPENDENT SETUPS. Production and Operations Management, 1(2), 225-228. https://doi.org/10.1111/j.1937-5956.1992.tb00354.x

PY - 1992/6

Y1 - 1992/6

N2 - A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.

AB - A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.

KW - Production/Scheduling

KW - Single Machine

KW - Deterministic Job Shop

KW - Mixed Integer Programming

U2 - 10.1111/j.1937-5956.1992.tb00354.x

DO - 10.1111/j.1937-5956.1992.tb00354.x

M3 - Article

SN - 1059-1478

VL - 1

SP - 225

EP - 228

JO - Production and Operations Management

JF - Production and Operations Management

IS - 2

ER -