Results 1 to 10 of about 3,941,634 (186)

Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems

open access: yesIEEE Access, 2020
Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj   +2 more sources

A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems

open access: yesApplied System Innovation, 2023
In this paper, the problem of finding an assignment of “n” surgeries to be presented in one of “m” identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed.
Amin Rahimi   +3 more
doaj   +2 more sources

Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm

open access: yesAlgorithms, 2020
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems.
Tamer F. Abdelmaguid
doaj   +2 more sources

Open shop scheduling games [PDF]

open access: yesEuropean Journal of Operational Research, 2021
This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of operations) to a different player, we can construct a cooperative TU-game associated with any open shop scheduling problem ...
Atay, Ata   +2 more
openaire   +5 more sources

A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates

open access: yesMathematical Biosciences and Engineering, 2019
In the open shop scheduling problem, resources and tasks are required to be allocated in an optimized manner, but when the arrival of tasks is dynamic, the problem becomes much more difficult.
Zilong Zhuang   +4 more
doaj   +2 more sources

A Heuristic Rule Based on Complex Network for Open Shop Scheduling Problem With Sequence-Dependent Setup Times and Delivery Times

open access: yesIEEE Access, 2019
In the real industrial scenario, the setup times and delivery times are two non-negligible factors, but only few studies have considered the open shop scheduling problem with sequence-dependent setup times and delivery times (OSSP-STDT). In this paper, a
Zilong Zhuang   +3 more
doaj   +2 more sources

Cat swarm optimization for solving the open shop scheduling problem

open access: yesJournal of Industrial Engineering International, 2018
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in ...
Abdelhamid Bouzidi   +2 more
doaj   +2 more sources

Examining the association between diet-related situational factor and dietary behavior: an observational study of diet-related situational factors in stroke patients during rehabilitation [PDF]

open access: yesFrontiers in Nutrition
BackgroundDietary behavior is affected by various factors and adverse dietary behavior is a risk factor for stroke recurrence. The current study examined the relationship between dietary behavior and relevant situational factors in stroke patients during
Weiying Zhong   +7 more
doaj   +2 more sources

No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods [PDF]

open access: yesInternational Journal of Supply and Operations Management, 2014
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling.
Bahman Naderi, Vahid Roshanaei
doaj   +3 more sources

Application of genetic algorithm to industrial scheduling and problems of parameters evaluation

open access: yesLietuvos Matematikos Rinkinys, 2021
Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy