Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

Jaw Yeh Chen, Sheng-Fuu Lin*

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

In this paper, a single-machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch-and-bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed.

Original languageEnglish
Pages (from-to)760-780
Number of pages21
JournalNaval Research Logistics
Volume49
Issue number8
DOIs
StatePublished - 1 Dec 2002

Keywords

  • Branch-and-bound
  • Dominance rule
  • Earliness/tardiness
  • Idle time
  • Scheduling theory

Fingerprint Dive into the research topics of 'Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted'. Together they form a unique fingerprint.

  • Cite this