Results 321 to 330 of about 1,874,071 (376)
Inequalities for stochastic flow shops and job shops [PDF]
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.
Michael Pinedo, Sung-Hwan Wie
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE/CAA Journal of Automatica Sinica, 2019
Flexible job shop scheduling problems ( FJSP ) have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence ( SI ) and evolutionary algorithms ( EA ) are developed, employed and improved ...
K. Gao +5 more
semanticscholar +1 more source
Flexible job shop scheduling problems ( FJSP ) have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence ( SI ) and evolutionary algorithms ( EA ) are developed, employed and improved ...
K. Gao +5 more
semanticscholar +1 more source
, 1996 Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire +1 more source
2008
This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the
openaire +2 more sources
This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the
openaire +2 more sources
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +2 more sources
GECCO Companion, 2020
Genetic programming, as a hyper-heuristic approach, has been successfully used to evolve scheduling heuristics for job shop scheduling. However, the environments of job shops vary in configurations, and the scheduling heuristic for each job shop is ...
Fangfang Zhang +3 more
semanticscholar +1 more source
Genetic programming, as a hyper-heuristic approach, has been successfully used to evolve scheduling heuristics for job shop scheduling. However, the environments of job shops vary in configurations, and the scheduling heuristic for each job shop is ...
Fangfang Zhang +3 more
semanticscholar +1 more source
The Quarterly Journal of Economics, 1978
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling
International Journal of Production Research, 2020Job shop scheduling, as one of the classical scheduling problems, has been widely studied in literatures, and proved to be mostly NP-hard. Although it is extremely difficult to solve job shop scheduling with no-wait constraint to optimality, the two ...
Zhi Pei +3 more
semanticscholar +1 more source
Flow Shops, Job Shops and Open Shops (Stochastic)
2008The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire +2 more sources
Scheduling job shops with delays
Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Stanley B. Gershwin +2 more
openaire +3 more sources