A survey on offline scheduling with rejection

Shabtay, Dvir; Gaspar, Nufar; Kaspi, Moshe

doi:10.1007/s10951-012-0303-z

Cited by 201 publications

(58 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Emami et al [6] considered nonidentical parallel machine environment in which the revenue from an accepted order and processing times are uncertain and developed a Lagrangian relaxation algorithm. Moreover, a series of related papers treat OAS from the perspective of order rejection, and a comprehensive survey was made by Shabtay et al [7]. For the unrelated parallel machine scheduling with rejection, the new studies after the survey [7] are reviewed as follows.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Moreover, a series of related papers treat OAS from the perspective of order rejection, and a comprehensive survey was made by Shabtay et al [7]. For the unrelated parallel machine scheduling with rejection, the new studies after the survey [7] are reviewed as follows. Hsu and Chang [8] studied the problem with deteriorating jobs to minimize of the sum of total rejection cost and a scheduling criterion and proved that if the scheduling criterion is either total load or total completion time, the problem is solvable in polynomial time.…”

Section: Literature Reviewmentioning

confidence: 99%

“…, } determines the accepted orders and their processing machines. Based on the idea proposed by Shabtay et al [7], if = +1, then reject order ; otherwise, schedule order to machine .…”

Section: Comparison Algorithm and Parametermentioning

confidence: 99%

See 2 more Smart Citations

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

Wang

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper studies the order acceptance and scheduling problem on unrelated parallel machines with machine eligibility constraints. Two objectives are considered to maximize total net profit and minimize the makespan, and the mathematical model of this problem is formulated as multiobjective mixed integer linear programming. Some properties with respect to the objectives are analysed, and then a classic list scheduling (LS) rule named the first available machine rule is extended, and three new LS rules are presented, which focus on the maximization of the net profit, the minimization of the makespan, and the trade-off between the two objectives, respectively. Furthermore, a list-scheduling-based multiobjective parthenogenetic algorithm (LS-MPGA) is presented with parthenogenetic operators and Pareto-ranking and selection method. Computational experiments on randomly generated instances are carried out to assess the effectiveness and efficiency of the four LS rules under the framework of LS-MPGA and discuss their application environments. Results demonstrate that the performance of the LS-MPGA developed for trade-off is superior to the other three algorithms.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

Wang

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The work is difficult and timeconsuming [1][2][3]. In allusion to the problems mentioned above, little research work has been conducted on this aspect [4]. Xia worked on algorithms for optimization of blending electrolytic cells without considering scheduling [5].…”

Section: Introductionmentioning

confidence: 99%

A New Approach to Blending and Loading Problem of Molten Aluminum

Wei²

2014

j.eng.technol.sci.

View full text Add to dashboard Cite

Abstract. The problems of blending electrolyzer and multi-constraint optimization of electrolytic aluminum scheduling in the electrolytic aluminum production process were addressed. Based on a mathematical model analysis, a novel hybrid optimization algorithm is proposed for optimization of blending together the molten aluminum in different electrolytic cells. An affinity degree function was designed to represent the path of aluminum scheduling. The mutation operators were designed to implement the transformation of electrolyzer combination and change the route of loading. A typical optimization example from an aluminum plant in northwest China is given in this paper, the results of which demonstrate the effectiveness of the proposed method.

show abstract

“…Shabtay [22] considered the scheduling problem with rejection on a single serial-batching machine. The reader is referred to Shabtay et al [23] for more relevant and detailed discussion of this topic.…”

mentioning

confidence: 99%

Scheduling a Bounded Parallel-Batching Machine with Incompatible Job Families and Rejection

Chen

2014

J. Oper. Res. Soc. China

View full text Add to dashboard Cite

We study a scheduling problem with incompatible job families and rejection on a parallel-batching machine, where the objective is to minimize the makespan of all accepted jobs plus the total penalty of all rejected jobs. We provide a polynomial-time algorithm for the case where all jobs have identical release dates and a pseudo-polynomial-time algorithm for the case where the number of distinct release dates is fixed. We also present a 2-approximation algorithm and a polynomial-time approximation scheme for the general problem.

show abstract

A survey on offline scheduling with rejection

Cited by 201 publications

References 65 publications

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

A New Approach to Blending and Loading Problem of Molten Aluminum

Scheduling a Bounded Parallel-Batching Machine with Incompatible Job Families and Rejection

Contact Info

Product

Resources

About