Note on scheduling with general learning curves to minimize the number of tardy jobs

G. Mosheiov; J. B. Sidney

doi:10.1057/palgrave.jors.2601809

Note on scheduling with general learning curves to minimize the number of tardy jobs

G. Mosheiov^*, J. B. Sidney

^*Corresponding author for this work

Business Administration

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

67 Scopus citations

Abstract

Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the learning process is assumed to be general and job-dependent, the problem remains polynomially solvable.

Original language	American English
Pages (from-to)	110-112
Number of pages	3
Journal	Journal of the Operational Research Society
Volume	56
Issue number	1
DOIs	https://doi.org/10.1057/palgrave.jors.2601809
State	Published - Jan 2005

Bibliographical note

Funding Information:
Acknowledgements—This work was supported in part by the Recanati Fund of the School of Business, The Hebrew University, Jerusalem and by the National Science and Engineering Research Council (NSERC) of Canada Grant Number OGP0002507.

Keywords

Learning curves
Scheduling
Single-machine

Access to Document

10.1057/palgrave.jors.2601809

Cite this

@article{5a1b41cde353433a8290538542096aa9,

title = "Note on scheduling with general learning curves to minimize the number of tardy jobs",

abstract = "Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the learning process is assumed to be general and job-dependent, the problem remains polynomially solvable.",

keywords = "Learning curves, Scheduling, Single-machine",

author = "G. Mosheiov and Sidney, {J. B.}",

note = "Funding Information: Acknowledgements—This work was supported in part by the Recanati Fund of the School of Business, The Hebrew University, Jerusalem and by the National Science and Engineering Research Council (NSERC) of Canada Grant Number OGP0002507.",

year = "2005",

month = jan,

doi = "10.1057/palgrave.jors.2601809",

language = "American English",

volume = "56",

pages = "110--112",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - Note on scheduling with general learning curves to minimize the number of tardy jobs

AU - Mosheiov, G.

AU - Sidney, J. B.

N1 - Funding Information: Acknowledgements—This work was supported in part by the Recanati Fund of the School of Business, The Hebrew University, Jerusalem and by the National Science and Engineering Research Council (NSERC) of Canada Grant Number OGP0002507.

PY - 2005/1

Y1 - 2005/1

N2 - Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the learning process is assumed to be general and job-dependent, the problem remains polynomially solvable.

AB - Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the learning process is assumed to be general and job-dependent, the problem remains polynomially solvable.

KW - Learning curves

KW - Scheduling

KW - Single-machine

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

U2 - 10.1057/palgrave.jors.2601809

DO - 10.1057/palgrave.jors.2601809

M3 - Article

AN - SCOPUS:12144249183

SN - 0160-5682

VL - 56

SP - 110

EP - 112

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 1

ER -

Note on scheduling with general learning curves to minimize the number of tardy jobs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this