Cited By
View all- Sun LLin LGen MLi H(2019)A Hybrid Cooperative Coevolution Algorithm for Fuzzy Flexible Job Shop SchedulingIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2019.289556227:5(1008-1022)Online publication date: May-2019
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most Pmax/2 greater than the optimal schedule length, where Pmax is the ...
We consider job selection problems in shops with ordered machines.We solve the open shop problem in polynomial time.We show that the job shop problem is ordinary NP-hard.We consider the flow shop problem with the total job completion time objective. We ...
This paper deals with the no-wait job shop scheduling problem resolution. The problem is to find a schedule to minimize the makespan ($$C_{max}$$Cmax), that is, the total completeness time of all jobs. The no-wait constraint occurs when two consecutive ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in