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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)


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 languageEnglish
Pages (from-to)321-324
Number of pages4
JournalComputers and Operations Research
Issue number3
Publication statusPublished - 1 Jan 1990
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this