Results 331 to 340 of about 680,167 (353)
Analysis of Job Flow-Time in a Job Shop [PDF]
Journal of the Operational Research Society, 1985 This paper is concerned with analytical determination of the mean and standard deviation of the job flow-time in a job shop in which the F.C.F.S. dispatching rule is in use. A hypothetical job shop is constructed to generate simulation results for comparison with the analytical results.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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.
Farhad Kianfar, Hamid Safarzadeh
openaire +2 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
Efficiency of reductions of job-shop to flow-shop problems
European Journal of Operational Research, 2000We study the problem of scheduling N independent jobs in a job-shop environment. Each job must be processed on at most M machines according to individual routes. The objective is to minimise the maximum completion time of the jobs. First, the job-shop problem is reduced to a flow-shop problem with job precedence constraints.
openaire +4 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
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
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 +2 more sources
Job-shop with two jobs and irregular criteria
2008We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is anearliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm.
Hendel, Yann, Sourd, Francis
openaire +2 more sources
General flow-shop and job-shop problems
1976In this chapter we consider general flow-shop and job-shop problems for which the number m of machines is variable. All these problems can be proved to be NP-complete from results in previous chapters; consequently the algorithms discussed in this chapter are mainly of the branch-and-bound type.
openaire +2 more sources