Skip navigation

Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects

Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects

Soper, Alan J. ORCID logoORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly (2019) Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. Journal of Scheduling, 23 (6). pp. 665-680. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-019-00628-4)

[thumbnail of Open Access Article]
Preview
PDF (Open Access Article)
25664 SOPER_Refined_Conditions_for_V-Shaped_Optimal_Sequencing_On_a_Single_Machine_(Pub_OA)_2019.pdf - Published Version
Available under License Creative Commons Attribution.

Download (404kB) | Preview
[thumbnail of Author Accepted Manuscript]
Preview
PDF (Author Accepted Manuscript)
25664 SOPER_Refined_Conditions_for_V-Shaped_Optimal_Sequencing_On_a_Single_Machine_(OA)_2019.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (334kB) | Preview

Abstract

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 SPT (Shortest Processing Time) and/or LPT (Longest Processing Time). 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 other hand, we show that even the refined approach has its limitations.

Item Type: Article
Uncontrolled Keywords: Scheduling, single machine, positional effect, cumulative effect, total completion time, V-shaped V-shaped
Subjects: Q Science > QA Mathematics
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Faculty of Engineering & Science
Last Modified: 04 Mar 2022 13:06
URI: http://gala.gre.ac.uk/id/eprint/25664

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics