Results 271 to 280 of about 23,175 (311)
Some of the next articles are maybe not open access.
Simulation of a Simplified Job Shop
Management Science, 1960This is a report of the results of some digital computer simulation studies of a simplified model of a job shop production process. Such factors as the average effectiveness of schedules under the impact of random variations in processing times and the effect of changing operating policies are considered.
C. T. Baker, B. P. Dzielinski
openaire +2 more sources
The machine duplication problem in a job shop with two jobs
International Transactions in Operational Research, 1995This paper addresses a problem related to the classical job shop scheduling problem with two jobs. The problem consists in concurrently determining the best subset of machines to be duplicated and the optimal scheduling of the operations in order to minimize completion time.
Alessandro Agnetis, Gianpaolo Oriolo
openaire +3 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
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
The Job-Shop Problem and Immediate Selection
Annals of Operations Research, 1994For solving job-shop problems using a branch-and-bound method it is important to introduce order relations before the branching starts in order to reduce the computational effort. This may be done by using immediate selection methods to fix as many order relations as possible.
Peter Brucker +2 more
openaire +3 more sources
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
Efficiency of reductions of job-shop to flow-shop problems
European Journal of Operational Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
A Review of Job Shop Scheduling
Journal of the Operational Research Society, 1966This paper discusses the more recent literature on job-shop-like sequencing problems.The types of problems can be broadly classified as "due date" or "minimum make-span" and among the solutions des...
openaire +2 more sources
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.
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.
openaire +2 more sources