Results 181 to 190 of about 14,397 (225)
Some of the next articles are maybe not open access.
A note on minimum makespan assembly plans
European Journal of Operational Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GALLO, GIORGIO ANGELO +1 more
openaire +4 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 +2 more sources
Minimizing Makespan in a Class of Reentrant Shops
Operations Research, 1997We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule the jobs so as to minimize the makespan.
Wang, M.Y. +2 more
openaire +5 more sources
Scheduling with Rejection to Minimize the Makespan
2009In this paper, we consider the scheduling with rejection. The objective functions are to minimize the maximum completion time of the processed ones when the total compression cost is given. Firstly, we prove that the problem 1|rej | C max /TCP is NP-hard, which implying that P m |rej | C max /TCP , 1 |rej , r j |C max /TCP , 1 |rej , on *** line |C max
Yuzhong Zhang +2 more
openaire +2 more sources
ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER
International Journal of Foundations of Computer Science, 2014In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results: (i) for m > 51 identical machines, we give a 1.5-competitive online algorithm with a buffer of size ⌈1.5m⌉; (ii) for three identical machines, we give an optimal online algorithm with a buffer size six, better than the ...
Ning Ding +5 more
openaire +2 more sources
Minimizing makespan on a single machine subject to random breakdowns
Operations Research Letters, 2006 We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns.
Nihat Kasap +2 more
exaly +2 more sources
Minimization of Makespan in Generalized Assignment Problem
OPSEARCH, 1999A quantitative combinatorial search problem consisting of m sources supplying in bulk to n(> m) destinations is considered in this paper. Each destination receives its full quota of a homogeneous product from a single source but a source can supply to many destinations subject to its capacity restrictions.
Arora, Shalini, Puri, M. C.
openaire +2 more sources
Concurrent flowshop scheduling to minimize makespan
European Journal of Operational Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christos Koulamas, George J. Kyparisis
openaire +2 more sources
Online Makespan Minimization with Budgeted Uncertainty
2021We study Online Makespan Minimization with uncertain job processing times. Jobs are assigned to m parallel and identical machines. Preemption is not allowed. Each job has a regular processing time while up to \(\varGamma \) jobs fail and require additional processing time.
Susanne Albers, Maximilian Janke
openaire +1 more source
Makespan distribution of permutation flowshop schedules
Journal of Scheduling, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Jin +3 more
openaire +1 more source