Results 171 to 180 of about 23,190 (193)

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

Rescheduling to minimize makespan under a limit on the makespan of the original jobs

2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), 2010
We consider the rescheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion time of its jobs only.
null Yundong Mu, null Cunchang Gu
openaire   +1 more source

Exponential size neighborhoods for makespan minimization scheduling

Naval Research Logistics, 2011
Summary: We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst-case approximation guarantees for the local ...
Brueggemann, T., Hurink, J.L., Vredeveld, T., Woeginger, G.J.   +3 more
openaire   +4 more sources

A note on minimum makespan assembly plans

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GALLO, GIORGIO ANGELO, SCUTELLA', MARIA GRAZIA   +1 more
openaire   +3 more sources

Minimization of Makespan in Generalized Assignment Problem

OPSEARCH, 1999
A 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

Minimization of Makespan Quantiles

2011
In this chapter, we consider temporal networks whose task durations are functions of a resource allocation that can be chosen by the decision maker. The goal is to find a feasible resource allocation that minimizes the network’s makespan. We focus on non-renewable resources, that is, the resources are not replenished, and specified resource budgets ...
openaire   +1 more source

ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER

International Journal of Foundations of Computer Science, 2014
In 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 ...
Ding, Ning, Lan, Yan, Chen, Xin, Dósa, György, Guo, He, Han, Xin   +5 more
openaire   +1 more source

Minimum makespan task sequencing with multiple shared resources

Robotics and Computer-Integrated Manufacturing, 2004
Nel presente lavoro si studia lo scheduling nelle celle robotizzate in presenza di un braccio meccanico che deve eseguire operazioni di load, process e unload su macchine a controllo numerico. Viene studiata la complessità del problema quando l'obiettivo è la minimizzazione del tempo di completamento delle lavorazione relative ai pezzi nello shop.
CARAMIA M, DELL'OLMO, Paolo, ONORI R.
openaire   +6 more sources

Makespan minimization in job shops

Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999
In this paper we present a polynomial time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operationsper job. The polynomial time approximation scheme can be extended to the case of job shop problems with release and delivery times, multiprocessor job shops, and dag job shops.
Solis-Oba, R., Jansen, K., Sviridenko, M.   +2 more
openaire   +2 more sources

Scheduling deteriorating jobs to minimize makespan

Naval Research Logistics, 1998
Summary: We consider a single-machine problem of scheduling \(n\) independent jobs to minimize makespan, in which the processing time of job \(J_j\) grows by \(w_j\) with each time unit its start is delayed beyond a given common critical date \(d\). This processing time is \(p_j\) if \(J_j\) starts by \(d\). We show that this problem is NP-hard, give a
Kubiak, Wieslaw, van de Velde, Steef
openaire   +2 more sources