Abstract:Multitasking scheduling problems with a deterioration effect incurred by coexisting behavioral phenomena in human-related scheduling systems including deteriorating task processing times and deteriorating rate-modifying activity (DRMA) of human operators are addressed. Under the assumption of this problem, the processing of a selected task suffers from the joint effect of available but unfinished waiting tasks, the position-dependent deterioration of task processing time, and the DRMA of human operators. Tradi… Show more
“…They analyze the computational complexity of these models and develop algorithms. Subsequently, researchers explore several extensions of Hall et al's multitasking model (Hall et al, 2015), introducing deterioration effects and rate‐modifying activities (Ji et al, 2019; Zhu et al, 2019; Zhu, Li, & Chu, 2017; Zhu, Zheng, & Chu, 2017). Liu et al (2017) further expand Hall et al's model by incorporating a common due date‐related objective.…”
This article considers an identical parallel‐machine task scheduling problem motivated by operations management of online services. A task with an integer processing time can be split into sub‐tasks with integer processing times. Each task has multiple integer milestones and at each milestone a nonnegative penalty will occur. The penalty value of a task at a milestone is a convex nonincreasing function of the completed amount by this milestone. Our objective is to determine a feasible schedule for all the tasks on given identical parallel machines, such that the sum of all tasks' total penalty at all milestones is minimized. We prove the NP‐hardness of this problem in the ordinary sense and develop a branch‐and‐price algorithm. Computational experiments utilizing data from an online service operations survey show that this algorithm is singularly efficient and promising.
“…They analyze the computational complexity of these models and develop algorithms. Subsequently, researchers explore several extensions of Hall et al's multitasking model (Hall et al, 2015), introducing deterioration effects and rate‐modifying activities (Ji et al, 2019; Zhu et al, 2019; Zhu, Li, & Chu, 2017; Zhu, Zheng, & Chu, 2017). Liu et al (2017) further expand Hall et al's model by incorporating a common due date‐related objective.…”
This article considers an identical parallel‐machine task scheduling problem motivated by operations management of online services. A task with an integer processing time can be split into sub‐tasks with integer processing times. Each task has multiple integer milestones and at each milestone a nonnegative penalty will occur. The penalty value of a task at a milestone is a convex nonincreasing function of the completed amount by this milestone. Our objective is to determine a feasible schedule for all the tasks on given identical parallel machines, such that the sum of all tasks' total penalty at all milestones is minimized. We prove the NP‐hardness of this problem in the ordinary sense and develop a branch‐and‐price algorithm. Computational experiments utilizing data from an online service operations survey show that this algorithm is singularly efficient and promising.
“…Multitasking is a common phenomenon that can be frequently observed in administrative planning, production environment, and business processes (Jez, 2011;Goes et al, 2018). In recent years, multitasking-related issues have attracted great attentions in the literature (Hall et al, 2015(Hall et al, , 2016Liu et al, 2017;Zhu et al, 2017aZhu et al, , 2017bJi et al, 2019;Xiong et al, 2019;Zhu et al, 2019;Wang et al, 2020). Multitasking is quickly switching and performing more than one task at a same time (Lin, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…Zhu et al (2017bZhu et al ( , 2019 studied multitasking scheduling with a rate-modifying activity (RMA), which considered that the operator takes regularly engages rest breaks during work shifts to recover/mitigate some negative effects. Zhu et al (2017a) also integrated the effect of available but unfinished waiting tasks, the position-dependent deterioration of task processing time, and the deteriorating ratemodifying activity (DRMA) of human operators. An optimal algorithm was proposed to minimize the makespan and the total absolute differences in completion time.…”
Section: Introductionmentioning
confidence: 99%
“…Developing an effective approach to the pricing problem is the key point of branch-and-price algorithm. Incorporating fast approaches in the B&P framework, such as greedy randomized adaptive search (Bard and Rojanasoonthon, 2006), binary decision diagram (Kowalczyk and Leus, 2018), labeling-set algorithm (Bulhoes et al, 2020), and heuristic (Xiong et al, 2019;Pereira et al, 2020), is an efficient way to deal Hall et al (2015Hall et al ( , 2016 Single machine None Zhu et al (2017aZhu et al ( , 2017bZhu et al ( , 2019 Single machine Rate-modifying activities, Deterioration effect Liu et al (2017) Single machine Due date assignment Wang et al (2020) Single machine Deterioration effect, Efficiency promotion Ji et al (2019) Parallel machines Slack due-window assignment Xiong et al (2019) Parallel machines None with large-size problems and achieved good results. Here we consider developing an artificial bee colony (ABC) algorithm to fast obtain the solutions of the pricing problem while the reduced cost is minimized.…”
Section: Introductionmentioning
confidence: 99%
“…Zhu et al. (2017a) also integrated the effect of available but unfinished waiting tasks, the position‐dependent deterioration of task processing time, and the deteriorating rate‐modifying activity (DRMA) of human operators. An optimal algorithm was proposed to minimize the makespan and the total absolute differences in completion time.…”
This paper addresses multitasking scheduling with batch control on parallel machines. The specific scenario can be found in the maintenance activities of skilled workers. The objective is to minimize the total weighted completion time. In the problem, each machine needs to be allocated at least to one batch of jobs. On each machine, the processing of a primary job may be interrupted by the waiting jobs of the same machine, which can be described as the multitasking scheduling. The existing algorithms and mathematical formulations of such a scheduling problem are not suitable for the problem. An exact branch-and-price algorithm with heuristic pricing strategy is devised. To fast find the minimized reduced cost of the pricing problem, an artificial bee colony algorithm is developed. Specifically, it is aimed at obtaining a partitioning schedule with a minimized reduced cost, which involves the allocation of batches and the multitasking scheduling of jobs. A weak enumeration operator is proposed to cope with the batch allocation. The computational results demonstrate that the branch-and-price algorithm with heuristic pricing strategy outperforms general-purpose pure CPLEX solver by orders of magnitude.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.