Paper Info
Title
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.
Abstract
In this paper, we consider several scheduling problems on a serial-batch machine for scheduling jobs with or without precedence relations. Under the serial-batch setting, the jobs in a batch are processed in succession and are removed until the last job in this batch finishes its processing. Thus, the processing time of a batch is equal to the sum of processing times of jobs in the batch. When a new batch starts, a constant setup time is required for the machine. The objectives of the problems involve minimizing makespan and a maximum cost. For these problems, we either present polynomial-time algorithms to generate all Pareto optimal points and find a corresponding Pareto optimal schedule for each Pareto optimal point, or give the strong NP-hardness proof. Experimentation results show that the proposed algorithms for the considered problems are very efficient.
Year
DOI
Venue
2018
10.1016/j.amc.2018.03.001
Applied Mathematics and Computation
Keywords
Field
DocType
Scheduling,Pareto optimization,Serial-batch,Maximum cost,Makespan
Mathematical optimization,Job shop scheduling,Scheduling (computing),Pareto optimal,Multi-objective optimization,Mathematics
Journal
Volume
ISSN
Citations 
332
0096-3003
0
PageRank 
References 
Authors
0.34
8
3
Name
Order
Citations
PageRank
Zhichao Geng151.17
Jinjiang Yuan221.08
Junling Yuan3166.52