Results 241 to 250 of about 82,206 (311)
, 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
International Journal of Production Research, 2020
There is a lack of studies on joint optimisation of flexible job-shop scheduling problem (FJSP) considering energy consumption and production efficiency in the machining-assembly system.
Weibo Ren +5 more
semanticscholar +1 more source
There is a lack of studies on joint optimisation of flexible job-shop scheduling problem (FJSP) considering energy consumption and production efficiency in the machining-assembly system.
Weibo Ren +5 more
semanticscholar +1 more source
Reactive scheduling approach for solving a realistic flexible job shop scheduling problem
International Journal of Production Research, 2020Reactive Scheduling (RS) and the realistic Flexible Job Shop Scheduling Problem (FJSSP) are of major importance for the implementation of real-world manufacturing systems.
B. Mihoubi, B. Bouzouia, Mehdi Gaham
semanticscholar +1 more source
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
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
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
, 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
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