Results 171 to 180 of about 84,439 (205)
Some of the next articles are maybe not open access.
Online scheduling of ordered flow shops
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Kangbok +2 more
openaire +2 more sources
Multicriteria Flow-Shop Scheduling Problem
2010Quality is, in real-life, a multidimensional notion. A schedule is described and valued on the basis of a number of criteria, for example: makespan, work-in-process inventories, idle times, observance of due dates, etc. An appropriate schedule cannot be obtained unless one observes the whole set of important criteria. The multidimensional nature of the
openaire +1 more source
Review on Hybrid Flow Shop Scheduling
2011 International Conference of Information Technology, Computer Engineering and Management Sciences, 2011As a vital decision-making progress, hybrid flow shops (HFS) are common manufacturing environments in which a set of n jobs are to be processed in a series of m stages optimizing a given objective function. Focusing on its complex nature, this paper presents a literature review on HFS scheduling problem, classifies the various type of the problem ...
openaire +1 more source
A Hybrid Flow Shop Scheduling Problem
2019Hybrid flow shop environment generally refers to the flow shop with multiple parallel machines per stage. Hybrid flow shop scheduling problem (HFSP) is a complex combinatorial optimization problem that came across in many real-life problems. In this study, a real-life HFSP of a lubricant company is considered, where the aim is to minimize total ...
Ayşegül Eda Özen +6 more
openaire +1 more source
Flow shop scheduling with lot streaming
Operations Research Letters, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potts, C. N., Baker, K. R.
openaire +1 more source
Scheduling in Flow and Open Shops
1996Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence. For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines.
Jacek Błażewicz +4 more
openaire +1 more source
Lagrangian Relaxation for Flow Shop Scheduling
1998Job shop scheduling encompasses combinatorial problems of extraordinary difficulty. The special structure of a flow shop, in which the machines can be ordered in series, offers some advantages. Employing the disjunctive graph as a model of a flow shop, we proceed to formulate a mixed integer model for the problem of minimizing the makespan.
openaire +1 more source