Results 151 to 160 of about 4,911,676 (214)

Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem

Knowledge-Based Systems, 2020
As economic globalization, large manufacturing enterprises build production centers in different places to maximize profit. Therefore, scheduling problems among multiple production centers should be considered.
W. Shao, Zhongshi Shao, D. Pi
semanticscholar   +1 more source

Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks

Engineering applications of artificial intelligence, 2020
Distributed scheduling problems have attracted much attention in recent years; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated.
Jingcao Cai, Rui Zhou, Deming Lei
semanticscholar   +1 more source

Permutation flow‐shop theory revisited

Naval Research Logistics Quarterly, 1978
AbstractThe paper provides a new theoretical framework for generating dominance conditions and lower bounds and for solving special cases. All existing and new results have been derived in a routine and simple manner.
openaire   +1 more source

Inequalities for stochastic flow shops and job shops

Applied Stochastic Models and Data Analysis, 1986
AbstractConsider an m‐machine flow shop with n jobs. The processing time of job j, j = 1,…, n, on each one of the m machines is equal to the random variable Xj and is distributed according to Fj. We show that, under certain conditions, more homogeneous distributions F1,…, Fn result in a smaller expected makespan.
Pinedo, Michael, Wie, Sung-Hwan
openaire   +2 more sources

Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time

Applied Soft Computing, 2020
Sustainable scheduling problems have been attracted great attention from researchers. For the flow shop scheduling problems, researches mainly focus on reducing economic costs, and the energy consumption has not yet been well studied up to date ...
Yu-yan Han, Jun-qing Li, Hongyan Sang, Yiping Liu, K. Gao, Q. Pan   +5 more
semanticscholar   +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.
Yu, Wei, Liu, Zhaohui, Wang, Leiyang, Fan, Tijun   +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.
Li, Shi-Sheng, Qian, De-Liang, Chen, Ren-Xia   +2 more
openaire   +2 more sources

The Robust Flow Shop

2012
In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter.
Hamilton Emmons, George Vairaktarakis
openaire   +1 more source

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 ...
Daniels, Richard L., Mazzola, Joseph B.
openaire   +1 more source

Clustered flow shop models

Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source