Results 221 to 230 of about 13,316 (264)

Practical job shop scheduling

Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Open shops with jobs overlap––revisited

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Chelliah Sriskandarajah   +3 more
openaire   +2 more sources

Lot Streaming in Job-Shop Scheduling

Operations Research, 1997
The 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, Jean-Bernard Lasserre   +1 more
openaire   +1 more source

The Job-Shop Problem and Immediate Selection

Annals of Operations Research, 1994
For 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, Bernd Jurisch, Andreas Krämer   +2 more
openaire   +2 more sources

Minimizing Makespan in No-Wait Job Shops

Mathematics of Operations Research, 2005
In 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, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Job-Shop Execution

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

Job shop scheduling

2001
Luis C. Rabelo, Albert Jones
openaire   +1 more source

Lean and Machine Shops and Job Shops

2022
Charles Protzman, Fred Whiton, Joyce Kerpchar   +2 more
openaire   +1 more source

Job Shop

1994
V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich   +2 more
openaire   +1 more source