Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
| Autor: | Alan Soper, Vitaly A. Strusevich |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
021103 operations research Single-machine scheduling Job shop scheduling Computer science 0211 other engineering and technologies General Engineering 02 engineering and technology Management Science and Operations Research 020901 industrial engineering & automation Artificial Intelligence Subsequence Completion time QA Algorithm Software Cumulative effect |
| ISSN: | 1094-6136 |
| Popis: | We address single-machine scheduling problems for which the actual processing times of jobs are subject to various effects, including a positional effect, a cumulative effect and their combination. We review the known results on the problems to minimize the makespan, the sum of the completion times and their combinations and identify the problems for which an optimal sequence cannot be found by simple priority rules such as Shortest Processing Time (SPT) and/or Longest Processing Time (LPT). Typically, these are problems to minimize the sum of the completion times under a deterioration effect, and we verify under which conditions for these problems an optimal permutation is V-shaped (an LPT subsequence followed by an SPT subsequence). We demonstrate that previously used techniques for proving that an optimal sequence is V-shaped are not properly justified. We use the corrected method to describe a wide range of problems with a pure positional effect and a combination of a cumulative effect with a positional effect for which an optimal sequence is V-shaped. On the other hand, we show that even the refined approach has its limitations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink