.png){kind=icon}
.png){kind=icon}
Return
Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2018.1497312.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of parallel-machine scheduling with machine-dependent slack (SLK) due-window assignment in the multitasking environment, which exists in various application domains such as Internet services, project management, and manufacturing. Motivated by practical observations, we extend the original model of multitasking to a more general model where each job's interruption proportion depends on the job itself and its processing position. In the light of individualised service, we consider SLK due-window assignment. Our objective is to minimise the total cost that comprises the earliness, tardiness, and due-window-related costs. Finding that an optimal schedule exists when each machine is occupied by at least one job, we show that the problem is polynomially solvable. We provide a more efficient solution algorithm for a special case of the problem. Finally, we present numerical examples to illustrate the application of the theoretical results and working of the solution algorithms.
Keywords:
multitasking
scheduling
SLK due-window
assignment
parallel machines
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
View more organizations