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 | |
| Publication status | Published - 1 Jan 1990 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver