Results 301 to 310 of about 122,671 (350)
, 1992 The job shop scheduling problem is described as follows. Given are a set of jobs and a set of machines. Each machine can handle at most one job at a time. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Job-Shop Scheduling by Implicit Enumeration
Management Science, 1977The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work. A general bounding approach is developed which includes all previously presented lower bounds as special cases. The strongest bound obtainable in this way
B. J. Lageweg +2 more
openaire +2 more sources
, 1999 Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
openaire +1 more source
International Journal of Production Economics, 1996
Abstract This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem. Some static problems with fuzzy information regarding due dates and/or operation times are solved using a branch-and-bound algorithm and the meaning of solving such scheduling problems is described.
Mitsuru Kuroda, Zeng Wang
openaire +2 more sources
Abstract This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem. Some static problems with fuzzy information regarding due dates and/or operation times are solved using a branch-and-bound algorithm and the meaning of solving such scheduling problems is described.
Mitsuru Kuroda, Zeng Wang
openaire +2 more sources
Scheduling the dynamic job shop
[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002The augmented Lagrangian decomposition and coordination technique is applied to a continuous-time formulation of the scheduling problem in a job shop environment. This methodology generates a variety of information that can be used to initialize the algorithm after changes occur, including Lagrange multipliers.
D.J. Hoitomt, P.B. Luh
openaire +2 more sources
Distributed scheduling of job shops
Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002A distributed job shop scheduling algorithm has been implemented in the LAN (local area network) environment. The algorithm is a good candidate for distributed implementation since much of the computation time required for a solution is expended in distributable portions of the algorithm.
D.J. Hoitomt, J.B. Perkins, P.B. Luh
openaire +2 more sources
Job-Shop Sequencing and Scheduling [PDF]
, 1994 In the framework of the integrated model introduced in Chapter III, we are first interested in finding an optimal schedule in a job-shop. This difficult problem has been largely discussed in the literature for more than 20 years (see [Balas 69], [Mc Mahon et Florian 75], [Baker 87], [Carlier 78], [Lageweg et ai 77], [Barker and Mc Mahon 85] or [Carlier
Jean B. Lasserre +1 more
openaire +1 more source
Heuristics in Job Shop Scheduling
Management Science, 1966The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due dates are met, or failing this, the sum of lateness times is minimized. The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority ...
openaire +2 more sources
Lot Streaming in Job-Shop Scheduling
Operations Research, 1997The issue in Lot Streaming is how to split lots into sublots in order to improve the makespan (or some other criterion). We present a model and an iterative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublots on the machines, and a standard job-shop scheduling ...
Stéphane Dauzère-Pérès +1 more
openaire +2 more sources