A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

Edwin Tai Chiu Cheng

doi:10.1016/0305-0548(90)90009-V

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

Edwin Tai Chiu Cheng

Research output: Journal article publication › Journal article › Academic research › peer-review

11 Citations (Scopus)

Abstract

This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs.

Original language	English
Pages (from-to)	321-324
Number of pages	4
Journal	Computers and Operations Research
Volume	17
Issue number	3
DOIs	https://doi.org/10.1016/0305-0548(90)90009-V
Publication status	Published - 1 Jan 1990
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

More information

10.1016/0305-0548(90)90009-V

Cite this

@article{cb6ecaf0f6c2408c890384203fd6032e,

title = "A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem",

abstract = "This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs.",

author = "Cheng, {Edwin Tai Chiu}",

year = "1990",

month = jan,

day = "1",

doi = "10.1016/0305-0548(90)90009-V",

language = "English",

volume = "17",

pages = "321--324",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

AU - Cheng, Edwin Tai Chiu

PY - 1990/1/1

Y1 - 1990/1/1

N2 - This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs.

AB - This note presents a partial search algorithm to solve the single-machine common due-date assignment and sequencing problem to minimize the weighted sum of earliness and tardiness of jobs.

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

U2 - 10.1016/0305-0548(90)90009-V

DO - 10.1016/0305-0548(90)90009-V

M3 - Journal article

SN - 0305-0548

VL - 17

SP - 321

EP - 324

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this