Results 251 to 260 of about 1,040,059 (296)
Some of the next articles are maybe not open access.
Route-Dependent Open-Shop Scheduling
IIE Transactions, 1983Abstract Open-shop scheduling, where the processing times of the operations constituting a job depend on the route by which it passes through the machines, is proved to be the master problem of which both open-shop and flow-shop scheduling are special cases.
I. Adiri, N. Amit
openaire +1 more source
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
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
Journal of Information and Optimization Sciences, 2002
The problem of processing of job lot of n identical items in a general shop where each item in the lot requires processing in m distinct processors, in any order, is considered. The m processors are not necessarily available at the same time to process the job lot.
openaire +1 more source
The problem of processing of job lot of n identical items in a general shop where each item in the lot requires processing in m distinct processors, in any order, is considered. The m processors are not necessarily available at the same time to process the job lot.
openaire +1 more source
Four decades of research on the open-shop scheduling problem to minimize the makespan
European Journal of Operational Research, 2021Mohammad Mahdi Ahmadian +2 more
exaly