Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
type: Item
instance of: scholarly article
title: Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
zbMATH Open document ID: 1427.90160
DOI: 10.1155/2018/6024631
author: Bailin Wang
author: Haifeng Wang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7019220
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/6024631
OpenAlex ID: W2793037814
cites work: A survey on offline scheduling with rejection
cites work: Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
cites work: A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
cites work: Parallel machine scheduling with machine availability and eligibility constraints
cites work: List scheduling in a parallel machine environment with precedence constraints and setup times
cites work: Q5047319
cites work: Flowshop-scheduling problems with makespan criterion: a review
cites work: Q3525910
Wikidata QID: Q130186469
description: scientific article; zbMATH DE number 7019220