A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems
In this paper, the problem of finding an assignment of “<i>n</i>” surgeries to be presented in one of “<i>m</i>” identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathemat...
Main Authors: | Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh, Mirpouya Mirmozaffari |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-01-01
|
Series: | Applied System Innovation |
Subjects: | |
Online Access: | https://www.mdpi.com/2571-5577/6/1/15 |
Similar Items
-
Heuristics for no-wait flow shop scheduling problem
by: Kewal Krishan Nailwal, et al.
Published: (2016-09-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
Heuristics for a Two-Stage Assembly-Type Flow Shop with Limited Waiting Time Constraints
by: Jun-Hee Han, et al.
Published: (2021-11-01) -
A heuristic algorithm for scheduling in a flow shop environment to minimize makespan
by: Arun Gupta, et al.
Published: (2015-04-01) -
PENJADWALAN FLOWSHOP DENGAN MENGGUNAKAN SIMULATED ANNEALING
by: Muhammad Firdaus, et al.
Published: (2015-04-01)