Results 221 to 230 of about 84,491 (259)
Some of the next articles are maybe not open access.
The Flow Shop Scheduling Polyhedron with Setup Times
Journal of Combinatorial Optimization, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roger Z. Ríos-Mercado, Jonathan F. Bard
openaire +1 more source
On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
Operations Research, 1985Pinedo has conjectured that, in a stochastic flow shop with m machines, n − 2 deterministic jobs with unit processing time, and two stochastic jobs each with mean one, the sequence minimizing the expected makespan would schedule one of the stochastic jobs first and the other last.
S. Suresh +2 more
openaire +1 more source
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research, 2008In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1,…,m. In the permutation flow shop problem, it is also required that each machine process the set of all jobs in the same order.
Viswanath Nagarajan, Maxim Sviridenko
openaire +1 more source
A genetic algorithm for scheduling dual flow shops
Expert Systems with Applications, 2012This study examines a dual-flow shop-scheduling problem that allows cross-shop processing. The scheduling objective is to minimize the coefficient of variation of slack time (lateness), where the slack time (ST) of a job denotes the difference between its due date and total completion time.
Chie-Wun Chiou +3 more
openaire +1 more source
Hybrid flow shop scheduling with finite buffers
International Journal of Simulation and Process Modelling, 2018In this paper, the scheduling problem for hybrid flow shop is investigated with the consideration of the finite buffers. Different from the existing works which focus on the makespan minimisation under the constraints of given intermediate buffer sizes, this paper investigates how to decide the reasonable size of the intermediate buffer.
Zhonghua Han, Yue Sun, Xiaofu Ma, Zhe Lv
openaire +1 more source
Batching and scheduling in a multi-machine flow shop
Journal of Scheduling, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. T. Ng 0001, Mikhail Y. Kovalyov
openaire +1 more source
Job-shop production scheduling with reverse flows
European Journal of Operational Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed Amine Abdeljaouad +3 more
openaire +3 more sources
Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling
2009Each plant and/or service provider performs several tasks to satisfy customer demand. Every task consumes several resources in order to be completed. Scheduling deals with the allocation of limited resources to tasks over time. Because the resources used in manufacturing activities are very limited, scheduling becomes a very important concept in ...
Betul Yagmahan, Mehmet Mutlu Yenisey
openaire +1 more source
Block approach to the cyclic flow shop scheduling
Computers & Industrial Engineering, 2015We consider cyclic flow show problem with setups with minimization of cycle time.New elimination "block" properties are proposed.Block properties are used for neighborhood search acceleration.Implementation in tabu search algorithm and verification on benchmarks instances. The cyclic flow show problem with machine setups is considered in this paper. It
Wojciech Bozejko +2 more
openaire +1 more source