Results 171 to 180 of about 4,945,017 (242)
Some of the next articles are maybe not open access.
Efficient Scheduling in Open Shops
1996A new class of polynomially solvable problems within the class of open shop problems is explored. For the problems with \(m\) machines and \(n\) jobs, an optimal schedule is constructed by an algorithm with polynomial running time in \(m\) and \(n\) when there exists a machine, call it \(i'\), whose load \(l_{i'}\) exceeds the load of any other machine
openaire +2 more sources
Energy-efficient open-shop scheduling with multiple automated guided vehicles and deteriorating jobs
Journal of Industrial Information Integration, 2022Lijun He, R. Chiong, Wenfeng Li
semanticscholar +1 more source
Engineering applications of artificial intelligence, 2021
L. R. Abreu +2 more
semanticscholar +1 more source
L. R. Abreu +2 more
semanticscholar +1 more source
A PTAS for non-resumable open shop scheduling with an availability constraint
Journal of combinatorial optimization, 2021Yuan Yuan, Yan Lan, Ning Ding, Xin Han
semanticscholar +1 more source
Bi-objective dynamic multiprocessor open shop scheduling for maintenance and healthcare diagnostics
Expert systems with applications, 2021Tamer F. Abdelmaguid
semanticscholar +1 more source
Open-shop production scheduling with reverse flows
Computers & industrial engineering, 2021Saba Aghighi +3 more
semanticscholar +1 more source
Multiobjective Open Shop Scheduling
1999This chapter presents the results of scheduling the multiobjective open shop (OSSP). The study is conducted using two conflicting OSSP objectives: (1) minimization of makespan, and (2) minimization of the mean flow time of jobs.
openaire +1 more source