Results 341 to 350 of about 1,874,071 (376)
Some of the next articles are maybe not open access.
A mean value analysis model for job shops and job shop-like systems
Computers & Industrial Engineering, 1989Abstract We apply mean value analysis to determine some congestion measures (mean queue-length, mean flow time, expected throughput) of job shop-like systems such as the flexible manufacturing system (FMS). Computational aspects of the model are discussed.
H. C. Co, G. Li
openaire +2 more sources
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
A survey of job shop scheduling problem: The types and models
Computers & Operations Research, 2022Hegen Xiong +3 more
semanticscholar +1 more source
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
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
Survey of integrated flexible job shop scheduling problems
Computers & industrial engineering, 2022Xixing Li +8 more
semanticscholar +1 more source
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
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
Production and transport scheduling in flexible job shop manufacturing systems
Journal of Global Optimization, 2021S. Homayouni, D. Fontes
semanticscholar +1 more source