104,505 Hits in 3.3 sec

The cyclic compact open-shop scheduling problem

N.V.R. Mahadev, Ph. Solot, D. de Werra
1993 Discrete Mathematics  
Introduction We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2] .  ...  Formulation of the CCOSS The cyclic compact open-shop scheduling problem (CCOSS) is defined as follows: a collection 9 of processor types P,, . . . , P, is given together with a set $={(J1, . . .  ... 
doi:10.1016/0012-365x(93)90171-o fatcat:xkca6acuybfg3cgoflj6pfnm4a

Approximation algorithms for the multiprocessor open shop scheduling problem

Petra Schuurman, Gerhard J. Woeginger
1999 Operations Research Letters  
We i n vestigate the multiprocessor multi-stage open shop scheduling problem. In this variant of the open shop model, there are s stages, each consisting of a number of parallel identical machines.  ...  Secondly, f o r t h e m ultiprocessor two-stage open shop problem we derive a family of polynomial-time approximation algorithms whose worst case ratios can be made arbitrarily close to 3 2 .  ...  It has been shown that the makespan of any d e n s e s c hedule is at most twice the optimum makespan. 2 Dense schedules for the multiprocessor open shop A feasible schedule for an open shop problem  ... 
doi:10.1016/s0167-6377(99)00005-x fatcat:iauufyxo6rhitav2do7men5yiq

Applying simulated annealing to the open shop scheduling problem

1999 IIE Transactions  
This paper addresses the problem of scheduling nonpreemptive open shop with the objective of minimizing makespan.  ...  The algorithm is tested on randomly generated problems, benchmark problems in the literature, and new hard problems generated in this paper.  ...  However, most of the published results in this area has been focused on job shop and flow shop problems. This paper addresses the problem of scheduling open shops.  ... 
doi:10.1080/07408179908969848 fatcat:737mcz7wf5ev5l3b75mluvflou

Competitive genetic algorithms for the open-shop scheduling problem

Christian Prins
2000 Mathematical Methods of Operations Research  
For more than two machines, and when preemption is forbidden, the computation of minimum makespan schedules for the open-shop problem is NP-hard.  ...  This paper presents several GAs for the open-shop problem.  ...  open-shop scheduling problem  ... 
doi:10.1007/s001860000090 fatcat:iidecirxcfc3lat47z7capq5ze

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

Guanqun Ni, Lei Chen
2020 IEEE Access  
INTRODUCTION Open shop scheduling problems have many interesting applications.  ...  Given k activities, if the objective is to minimize the maximum completion time (the makespan), the open shop scheduling problem is modeled as k-machine open shop and denoted as Ok||C max .  ... 
doi:10.1109/access.2020.3030694 fatcat:esapxirim5fdxhjwviw7j72hym

A hybrid genetic algorithm for the open shop scheduling problem

Ching-Fang Liaw
2000 European Journal of Operational Research  
This paper examines the development and application of a hybrid genetic algorithm to the open shop scheduling problem.  ...  The algorithm is tested on randomly generated problems, and benchmark problems from the literature.  ...  open shop scheduling problem.  ... 
doi:10.1016/s0377-2217(99)00168-x fatcat:7yhhflaqgbhwvphwobtgidkfle

Cat swarm optimization for solving the open shop scheduling problem

Abdelhamid Bouzidi, Mohammed Essaid Riffi, Mohammed Barkatou
2018 Journal of Industrial Engineering International  
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  ...  The computational results, and the comparison of the relative percentage deviation of the proposed metaheuristic with other's existing in the literature, show that the cat swarm optimization algorithm  ...  Section four describes the proposed adaptation of cat swarm optimization to solve the open shop scheduling problem.  ... 
doi:10.1007/s40092-018-0297-z fatcat:qff6eawaoragpexe6hnvrimngm

A tabu search algorithm for the open shop scheduling problem

Ching-Fang Liaw
1999 Computers & Operations Research  
INTRODUCTION The open shop scheduling problem, or O||C max in the classification of Graham et al.  ...  It is shown that for m≥3, the open shop scheduling problem is NP-complete (Garey and Johnson [4] ). However, some special structured open shop scheduling problems are still polynomially solvable.  ... 
doi:10.1016/s0305-0548(98)00056-2 fatcat:6ahrukbqibd3bokidzobvrr5kq

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

Chaouqi Mohsine, Benhra Jamal, My Ali
2016 International Journal of Applied Information Systems  
The present paper deals with the open-shop scheduling problem using a manual tuning of a genetic algorithm's parameters.  ...  , the crossover probability, and the mutation probability.  ...  Naderi et al [16] studied the scheduling open shop problem with no intermediate buffer, called no-wait open shops under makespan minimization.  ... 
doi:10.5120/ijais2016451588 fatcat:dijku4fivredtguilpamjudt44

A note on the complexity of the concurrent open shop problem

Thomas A. Roemer
2006 Journal of Scheduling  
The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines.  ...  Their finding has thus once again opened up the question of the problem's complexity. This paper re-establishes that, even for two machines, the problem is NP-hard in the strong sense.  ...  an overview of the evolving literature stream of the concurrent open shop problem and exhibits its relative fragmentation.  ... 
doi:10.1007/s10951-006-7042-y fatcat:4ljxjs7fqjblpm442i2rfnpa6i

A Sequence List Algorithm For The Job Shop Scheduling Problem

Shuli Zhang
2013 Open Electrical & Electronic Engineering Journal  
According to the needs of the job shop scheduling problem, a sequence list algorithm for the job shop scheduling problem was designed in this paper.  ...  For the discrete manufacturing enterprises, the job shop scheduling problem is an important class of actual combinatorial optimization problem with resources and sequence constraints.  ...  The job shop scheduling problem has been proven to be NP-hard.  ... 
doi:10.2174/1874129001307010055 fatcat:or4prjss2nbj3csmhtp3vkdbre

A heuristic for the two-machine open-shop scheduling problem with transportation times

V.A. Strusevich
1999 Discrete Applied Mathematics  
The paper considers a problem of scheduling n jobs in a two-machine open shop to minimize the makespan, provided that preemption is not allowed and the interstage transportation times are involved.  ...  This problem is known to be unary NP-hard. We present an algorithm that requires O(n log n) time and provides a worst-case performance ratio of 3 2 . ? 1999 Elsevier Science B.V.  ...  Acknowledgements The author is grateful to D. Rebaine for helpful discussions in the early stages of this research. The support from Project INTAS 93-257 is acknowledged.  ... 
doi:10.1016/s0166-218x(99)00115-8 fatcat:7zjnzi4gfvh5lk52i3sctnufum

Group technology approach to the open shop scheduling problem with batch setup times

V.A. Strusevich
2000 Operations Research Letters  
This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption.  ...  For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches.  ...  Introduction In this paper, we consider the two-machine open shop scheduling problem with batch setup times.  ... 
doi:10.1016/s0167-6377(00)00021-3 fatcat:etbl7pagefczvmrkeqibipu7qi

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

T.C.Edwin Cheng, Natalia V. Shakhlevich
2005 European Journal of Operational Research  
doi:10.1016/j.ejor.2004.04.014 fatcat:kqoqozsqbfhtdp364cr5uokkey

An improved bat optimization algorithm to solve the tasks scheduling problem in open shop

Morteza Babazadeh Shareh, Shirin Hatami Bargh, Ali Asghar Rahmani Hosseinabadi, Adam Slowik
2020 Neural computing & applications (Print)  
The open shop scheduling problem involves a set of activities that should be run on a limited set of machines.  ...  The purpose of scheduling open shops problem is to provide a timetable for implementation of the entire operation so that the total execution time is reduced.  ...  Problem statement The OSSP is a matter of general task scheduling. The open shop is an NP-hard problem and solving it in polynomial time is not possible.  ... 
doi:10.1007/s00521-020-05055-7 fatcat:skr7lxyhmngdjly27k2vxmttuu
« Previous Showing results 1 — 15 out of 104,505 results