Results 201 to 210 of about 15,254 (266)

The no-wait flow shop with rejection

International Journal of Production Research, 2020
We consider the no-wait flow shop scheduling problem with rejection. We first show how to augment the travelling salesman problem formulation for the no-wait flow shop minimum makespan problem to i...
Christos Koulamas, George J. Kyparisis
openaire   +1 more source

On transforming job-shops into flow-shops

Production Planning & Control, 2002
In this paper the problem of transforming a job-shop environment into a flow-shop is addressed, where scheduling issues are simpler and pull production control systems might be easily applied. A linear programming model employing machine investment minimization as objective function is proposed.
Jose M. Framinan, Rafael Ruiz-Usano
openaire   +1 more source

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

Journal of Algorithms, 1993
The authors analyse two machine open shop and flow shop scheduling problems. The objective is to minimize the mean job completion time and job preemption is possible. Whereas these two problems on three machines are known to be NP-hard in the strong sense, the complexity status of the two machine problems has been unsolved. In this article, the authors
Jianzhong Du, Joseph Y.-T. Leung
openaire   +1 more source

The no-wait flow-shop paradox

Operations Research Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frits C. R. Spieksma, Gerhard J. Woeginger   +1 more
openaire   +1 more source

Multiobjective flow-shop scheduling

Naval Research Logistics, 1990
Summary: Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associted levels of two scheduling criteria, schedule
Daniels, Richard L., Chambers, Robert J.
openaire   +2 more sources

Scheduling flow shops with operators

International Journal of Production Research, 2018
This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines.
Imène Benkalai, Djamal Rebaine, Pierre Baptiste   +2 more
openaire   +2 more sources

Approximability of flow shop scheduling

Mathematical Programming, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Routing open shop and flow shop scheduling problems

European Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yu 0011, Zhaohui Liu 0001, Leiyang Wang, Tijun Fan   +3 more
openaire   +2 more sources

Proportionate Flow Shop Scheduling with Rejection

Asia-Pacific Journal of Operational Research, 2017
We consider the problem of scheduling [Formula: see text] jobs with rejection on a set of [Formula: see text] machines in a proportionate flow shop system where the job processing times are machine-independent. The goal is to find a schedule to minimize the scheduling cost of all accepted jobs plus the total penalty of all rejected jobs.
Shi-Sheng Li, De-Liang Qian, Ren-Xia Chen   +2 more
openaire   +2 more sources

Flow Shop Scheduling with Resource Flexibility

Operations Research, 1994
This paper explores the improvements in manufacturing efficiency that can be achieved by broadening the scope of production scheduling to include both the sequencing of work and the coordination of the resource inputs required to perform work. Recognizing that some resources are inherently flexible and thus can be reassigned dynamically to processing ...
Richard L. Daniels, Joseph B. Mazzola
openaire   +1 more source