Results 271 to 280 of about 6,312 (313)

Approximability of flow shop scheduling

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

Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling

2009
Each 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

Scheduling optimization of flexible flow shop

2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC), 2018
According to the production characteristics of flexible job shop scheduling in practice, the initial solution is generated by random Numbers, Gantt chart is drawn, and the maximum process time is calculated. Then, a simplified algorithm is proposed with reference to Johnson's algorithm.
Xuefeng Liu, Zhenhui Shen, Lingmin Dai
openaire   +1 more source

Flow-shop scheduling by heuristic decomposition

International Journal of Production Research, 1973
SUMMARY This paper investigates the classical n-job, M-machine flow-shop scheduling problem under the assumption that jobs are processed on all machines in the same order. Baaed on the heuristic job-pairing technique and the decomposition strategy, a heuristic decomposition algorithm is developed which will generate at least a near-optimal schedule for
J. N. D. GUPTA, A. R. MAYKUT
openaire   +1 more source

Permutation flow shop scheduling model

Permutation flow shop scheduling is a significant problem in operations research and industrial applications, characterized by its complexity and relevance in optimizing production processes. This abstract provides an overview of the permutation flow shop scheduling model, its key components, challenges, and methodologies employed for solving it.
NSV Kiran Kumar, Dr. Manish KR Singh
openaire   +1 more source

Online scheduling of ordered flow shops

European Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lee, Kangbok, Zheng, Feifeng, Pinedo, Michael L.   +2 more
openaire   +2 more sources

Hybrid flow shop scheduling: A survey

Computers & Industrial Engineering, 1999
Extensive work has been done in hybrid flow shop scheduling. This paper reviews the state of art and discusses in details their contributions. The review is concluded with suggestions for future research directions.
Linn, R., Zhang, W.
openaire   +2 more sources

Multicriteria Flow-Shop Scheduling Problem

2010
Quality 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, 2011
As 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

2019
Hybrid 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, Gülce Çini, Merve Çamlıca, Nilay Çınar, Hasan Bahtiyar Soydan, Levent Kandiller, Hande Öztop   +6 more
openaire   +1 more source