Scheduling parallel machines with inclusive processing set restrictions and job rejection

Abstract

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ( 5 3 + ε ) ‐approximation algorithm with a time complexity of O ( n 2 / ε 2 ) . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ( 5 3 + ε ) ‐approximation algorithm with a time complexity of O ( n m ε 2 · log P ) . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of O ( n log n ) . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017

Heuristics for parallel machine scheduling with GoS eligibility constraints

“…Leung and Ng (2017), on the other hand, extended the study of uniform parallel machine scheduling to improve the PTAS proposed by Epstein and Levin (2011). For minimizing other objectives, Ou et al (2016) solved the bi-objective parallel machine scheduling problem of minimizing the penalty cost of makespan and exiting jobs, and developed PTAS. Later, researchers started to use metaheuristics to solve parallel machine scheduling problems with different objectives.…”

Order acceptance and scheduling on unrelated parallel machines

“…The OAS problem has received extensively research attention over the past two decades [1]. Although the OAS problems have been studied with various objective functions, current researches focus more on two objective functions, that is, (1) maximization the total profit as the sum of revenues minus the total weighted tardiness [2][3][4][5][6][7][8][9][10][11][12][13], (2) minimization of the makespan of the accepted orders plus the total penalties of all rejected orders [14][15][16]. As previously stated, this paper studies the OAS problem on unrelated parallel machines with the first objective.…”

Efficient algorithms for flexible job shop scheduling with parallel machines

“…A classic job shop scheduling problem refers to a number of jobs to be scheduled on a set of perfectly reliable machines, whereas in reality, overall levels of reliability and production performance are usually vulnerable due to preventive maintenance and the unpredictable breakdown of machines. To increase production capacity and reduce disruptions, parallel machines have been introduced in job shops (Li, Liu, Sethi, & Xu, 2017; Liu & Kozan, 2016; Ou, Zhong, & Qi, 2016; Xiong, Zhou, Yin, Cheng, & Li, 2019; Yin, Wang, Cheng, Liu, & Li, 2017).…”