Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt. The objective is to minimize the makespan. We present O(n log n) time algorithms for the single-machine problems, respe...
Saved in:
Main Author: | Cuixia Miao |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/495187 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
by: Juan Zou, et al.
Published: (2014-01-01) -
Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
by: Lisi Cao, et al.
Published: (2020-01-01) -
Exact makespan minimization of unrelated parallel machines
by: Åblad, Edvin, et al.
Published: (2021-05-01) -
Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times
by: Ali Allahverdi, et al.
Published: (2003-01-01) -
A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan
by: Zhigang Lian
Published: (2010-01-01)