Results 251 to 260 of about 23,175 (311)
Constructive-destructive neighbor search drives artificial bee colony algorithm for variable speed green hybrid flowshop scheduling problem. [PDF]
Sci RepHu D, Wu Y, Qiu L, Mi J, Yang Y.
europepmc +1 more source
A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems. [PDF]
Sci RepKhurshid B +4 more
europepmc +1 more source
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 +2 more sources
, 1996 In this chapter we are going to consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence. We will assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout is the job shop.
Jan Węglarz +4 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +4 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
On transforming job-shops into flow-shops
Production Planning & Control, 2002In 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 +2 more sources
Job-shop scheduling in a body shop
Journal of Scheduling, 2012We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account.
Joachim Schauer, Cornelius Schwarz
openaire +2 more sources
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 +3 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 +3 more sources
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources