Scheduling with generalized and periodic due dates under single- and two-machine environments
| Autor: | Yunhong Min, Byung-Cheon Choi, Kyung-Min Kim, Myoung-Ju Park |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
021103 operations research Control and Optimization Job shop scheduling Computational complexity theory Computer science Tardiness 0211 other engineering and technologies Scheduling (production processes) Computational intelligence 010103 numerical & computational mathematics 02 engineering and technology Flow shop scheduling 01 natural sciences Due date Position (vector) 0101 mathematics |
| Zdroj: | Optimization Letters. 16:623-633 |
| ISSN: | 1862-4480 1862-4472 |
| DOI: | 10.1007/s11590-021-01739-8 |
| Popis: | We consider scheduling problems such that the due date is assigned to a job, depending on its position, and the intervals between consecutive due dates are identical. The objective is to minimize the weighted number of tardy jobs or the total weighted tardiness. Both two-machine flow shop and single-machine cases are considered. We establish the computational complexity of each case, based on the relationship with the scheduling problem with a common due date. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink