|
|
|
|
|
Mingming Xu, Shuning Zhang and Guanlong Deng
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a...
ver más
|
|
|
|
|
|
|
|
|
|
|
BongJoo Jeong, Jun-Hee Han and Ju-Yong Lee
This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to m...
ver más
|
|
|
|
|
|
|
|
|
|
|
Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan and Liang Gao
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to th...
ver más
|
|
|
|
|
|