Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness

4OR ◽  
2015 ◽  
Vol 14 (2) ◽  
pp. 153-164 ◽  
Author(s):  
Cheng He ◽  
Hao Lin
Keyword(s):  
Maximum Lateness ◽  
Hierarchical Optimization ◽  
Due Dates ◽  
Parallel Batching ◽  
Batching Machine

Hierarchical optimization on an unbounded parallel-batching machine

2018 ◽  
Vol 52 (1) ◽  
pp. 55-60
Author(s):  
Cheng He ◽  
Li Li
Keyword(s):  
Optimization Problem ◽  
Time Algorithm ◽  
Decision Makers ◽  
Hierarchical Optimization ◽  
Scheduling Problem ◽  
Objective Functions ◽  
Hierarchical Scheduling ◽  
Parallel Batching ◽  
Batching Machine

This paper studies a hierarchical optimization problem on an unbounded parallel-batching machine, in which two objective functions are maximum costs, representing different purposes of two decision-makers. By a hierarchical optimization problem, we mean the problem of optimizing the secondary criterion under the constraint that the primary criterion is optimized. A parallel-batching machine is a machine that can handle several jobs in a batch in which all jobs start and complete respectively at the same time. We present an O(n4)-time algorithm for this hierarchical scheduling problem.

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

1975 ◽  
Vol 23 (3) ◽  
pp. 475-482 ◽  
Author(s):  
Graham McMahon ◽  
Michael Florian
Keyword(s):  
Maximum Lateness ◽  
Due Dates

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

1983 ◽  
Vol 34 (7) ◽  
pp. 615 ◽  
Author(s):  
Jozef Grabowski ◽  
Ewa Skubalska ◽  
Czeslaw Smutnicki
Keyword(s):  
Flow Shop ◽  
Maximum Lateness ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Shop Scheduling

scholarly journals Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣rj∣Lmax,Cmax

2020 ◽  
Author(s):  
Alexander A. Lazarev ◽  
Nikolay Pravdivets
Keyword(s):  
Completion Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Pareto Optimal ◽  
Due Dates ◽  
Processing Times ◽  
Pareto Optimal Set ◽  
Maximum Completion Time

In this chapter, we consider the single machine scheduling problem with given release dates, processing times, and due dates with two objective functions. The first one is to minimize the maximum lateness, that is, maximum difference between each job due date and its actual completion time. The second one is to minimize the maximum completion time, that is, to complete all the jobs as soon as possible. The problem is NP-hard in the strong sense. We provide a polynomial time algorithm for constructing a Pareto-optimal set of schedules on criteria of maximum lateness and maximum completion time, that is, problem 1 ∣ r j ∣ L max , C max , for the subcase of the problem: d 1 ≤ d 2 ≤ … ≤ d n ; d 1 − r 1 − p 1 ≥ d 2 − r 2 − p 2 ≥ … ≥ d n − r n − p n .

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

2017 ◽  
Vol 258 (2) ◽  
pp. 478-490 ◽  
Author(s):  
Jun-Qiang Wang ◽  
Guo-Qiang Fan ◽  
Yingqian Zhang ◽  
Cheng-Wu Zhang ◽  
Joseph Y.-T. Leung
Keyword(s):  
Processing Time ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN

2014 ◽  
Vol 31 (04) ◽  
pp. 1450025 ◽  
Author(s):  
CHENG HE ◽  
HAO LIN ◽  
JINJIANG YUAN ◽  
YUNDONG MU
Keyword(s):  
Processing Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Maximum Cost ◽  
Parallel Batching ◽  
Multicriteria Problem ◽  
Batching Machine

In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest processing time of jobs in the batch. The main goal of a multicriteria problem is to find Pareto optimal solutions. We present a polynomial-time algorithm to produce all Pareto optimal solutions of this bicriteria scheduling problem.

scholarly journals Minimizing the makespan on a single parallel batching machine

2010 ◽  
Vol 411 (7-9) ◽  
pp. 1140-1145 ◽  
Author(s):  
Shenpeng Lu ◽  
Haodi Feng ◽  
Xiuqian Li
Keyword(s):  
Parallel Batching ◽  
Batching Machine
Sign in / Sign up

Export Citation Format

Share Document