Asset Details
Do you wish to reserve the book?
Solving the two-machine open shop problem with a single server with respect to the makespan
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Solving the two-machine open shop problem with a single server with respect to the makespan
Do you wish to request the book?
Solving the two-machine open shop problem with a single server with respect to the makespan
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Solving the two-machine open shop problem with a single server with respect to the makespan
2024
Overview
We address in this paper the two-machine open shop problem with a single server to prepare jobs before going through the processing so as to minimize the makespan. The server is only needed during the preparation phase before becoming available again, leaving the prepared job to complete its processing. We present three lower bounds with respect to the makespan. In addition, we show the NP-completeness of two restricted cases. Then, we present a well solvable case. Finally, we develop two mixed integer linear programming (MILP) models for the general problem along with an experimental study we conducted to analyze their performance.
Publisher
Springer Nature B.V
