Abstract
In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.
| Original language | English |
|---|---|
| Pages (from-to) | 110-118 |
| Number of pages | 9 |
| Journal | Computers and Operations Research |
| Volume | 36 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2009 |
Keywords
- Batch processing machine
- Bicriterion
- Scheduling
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'Bicriterion scheduling with equal processing times on a batch processing machine'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver