Scheduling two parallel machines with machine-dependent availabilities

A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 72; s. 31 - 42
Hlavní autoři: He, Jie, Li, Qingguo, Xu, Dehua
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.08.2016
Pergamon Press Inc
Témata:
Algorithms
Availability
Computer simulation
Heuristic
Heuristic methods
High strength steels
Integer programming
Job shops
Maintenance
Makespan
Operations research
Optimization algorithms
Parallel processing
Periodic maintenance
Polynomials
Production scheduling
Scheduling
Studies
Tool change
Scheduling
Makespan
Tool change
Periodic maintenance
Heuristic
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A two-parallel-machine scheduling problem with machine-dependent availabilities where one machine is subject to tool changes and the other is subject to periodic maintenance is considered. The objective is to determine the start time of each tool change activity and schedule all the jobs to the two machines such that the makespan is minimized. Due to the NP-hardness of the non-approximability of the problem, there does not exist any polynomial time approximation algorithm with a worst-case ratio less than 2 for the problem unless P=NP. To solve small sized and moderate sized instances of the problem, a mixed 0–1 programming model is proposed. To solve large sized instances of the problem, nine heuristic algorithms that employ two classical dispatching rules, two assignment mechanisms and a post-optimization procedure are proposed. To evaluate the performance of the algorithms, some machine setting featured lower bounds are provided. Computational experiment shows that the average-case relative error ratio of the heuristic algorithm that based on the classical LPT rule, two assignment procedures and a post-optimization procedure is less than 8%, which implies that it is promising for problem and suitable for real-world application. •A scheduling problem with machine-dependent availabilities is considered.•Nine heuristic algorithms are proposed.•Worst-case analyses are presented.•Machine setting featured lower bounds are provided.•Computational experiment is conducted.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2016.01.021