Results 221 to 230 of about 13,278 (264)
Some of the next articles are maybe not open access.
Open shops with jobs overlap––revisited
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y.-T. Leung +3 more
openaire +2 more sources
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
Analysis of Job Flow-Time in a Job Shop
Journal of the Operational Research Society, 1985This 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
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 +2 more sources
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research, 2005In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait job shop scheduling problem with the makespan objective function. It is known that the problem is MaxSNP-hard in the case when each job is allowed to have three operations or more. We show that if each job has at most two operations, the problem admits a PTAS if the
Bansal, N., Mahdian, M., Sviridenko, M.
openaire +1 more source
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 +3 more sources
1997
Scheduling is the allocation of shared resources over time to competing activities, and has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machines represent resources; each machine can process at most one job at ...
T. Yamada, R. Nakano
openaire +1 more source
Scheduling is the allocation of shared resources over time to competing activities, and has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machines represent resources; each machine can process at most one job at ...
T. Yamada, R. Nakano
openaire +1 more source
Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning
International Journal of Production Research, 2021Bhaba R Sarker
exaly
1996
Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire +1 more source
Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire +1 more source