Results 191 to 200 of about 4,494 (215)

Minimizing makespan in parallel flowshops [PDF]

Journal of the Operational Research Society, 1997
Summary: In this study, a new class of proportional parallel flow shop problems with the objective of minimizing the makespan has been addressed. A special case for this problem in which jobs are processed on only one machine as opposed to two or more machines in a flow shop, is the well-known multiple processor problem which is NP-complete.
P. S. Sundararaghavan, Anand S. Kunnathur, I Viswanathan   +2 more
openaire   +2 more sources

Minimizing makespan in a pallet-constrained flowshop [PDF]

Journal of Scheduling, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chelliah Sriskandarajah, Steef van de Velde, Han Hoogeveen, Michael Y. Wang, Suresh Sethi   +4 more
openaire   +5 more sources

Minimizing Makespan in a Class of Reentrant Shops [PDF]

Operations Research, 1997
We 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.
Suresh Sethi, M. W. Wang, S.L. van de Velde   +2 more
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

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.
Yundong Mu, Cunchang Gu
openaire   +2 more sources

Minimizing Makespan in No-Wait Job Shops [PDF]

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
Mohammad Mahdian, Maxim Sviridenko, Nikhil Bansal   +2 more
openaire   +1 more source

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   +4 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
Steef van de Velde, Wieslaw Kubiak
openaire   +3 more sources

Minimizing Makespan in Batch Machine Scheduling

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pixing Zhang, Chung Keung Poon
openaire   +4 more sources

Makespan Minimization with Machine Availability Constraints [PDF]

Discrete Mathematics, Algorithms and Applications, 2009
We investigate the problems of scheduling n jobs to m machines with availability constraints. We consider two different models of availability constraints: the preventive model where the unavailability is due to preventive machine maintenance, and the fixed job model where the unavailability is due to a priori assignment of some of the n jobs to ...
Yumei Huo, Hairong Zhao, Bin Fu
openaire   +2 more sources

Makespan-Optimal Cache Partitioning

2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, 2013
In current multicore systems, cache memory is shared between multiple concurrent threads. Allocating the proper amount of cache to each thread is crucial to achieving high performance. Cache management in many existing systems is based on the least recently used replacement policy, which can lead to adverse contention between threads for shared cache ...
Pan Lai, Rui Fan
openaire   +2 more sources