Results 251 to 260 of about 1,414,367 (299)
Some of the next articles are maybe not open access.
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 +1 more source
1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Cyclic Schedules for Job Shops with Identical Jobs
Mathematics of Operations Research, 1992We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a pre-determined sequence. Each operation can be performed on exactly one machine.
openaire +3 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.
Jacek Błażewicz +4 more
openaire +1 more source
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.
Jacek Błażewicz +4 more
openaire +1 more source
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,
Nirwan Ansari, Edwin Hou
openaire +2 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,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
Job shop scheduling with the option of jobs outsourcing
International Journal of Production Research, 2019Incorporating outsourcing in scheduling is addressed by several researchers recently. However, this scope is not investigated thoroughly, particularly in the job shop environment.
Hamid Safarzadeh, Farhad Kianfar
openaire +2 more sources
Scheduling job shops with transfer lots
Proceedings of IEEE International Conference on Robotics and Automation, 2002For the production of mid to high volume products with long setups, products are generally grouped into production lots. Previously, lot splitting techniques were used to split a lot into multiple smaller transfer lots, and each transfer lot can be transferred to its successor operation immediately upon completion.
Guandong Liu, Peter B. Luh
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 +1 more source
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
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