Open Access
Approximation algorithm for parallel machine scheduling with a common server
Guoqing Wang,T.C.E. Cheng +1 more
- 01 Jan 2001
25
TL;DR: In this paper, the scheduling of a given set of jobs on several identical parallel machines tended by a common server is studied, where each job must be processed on one of the machines and the objective is to schedule the jobs so as to minimize the total weighted job completion times.
read more
Abstract: In this paper we study the scheduling of a given set of jobs on several identical parallel machines tended by a common server. Each job must be processed on one of the machines. Prior to processing, the server has to set up the relevant machine. The objective is to schedule the jobs so as to minimize the total weighted job completion times. We provide an approximation algorithm to tackle this intractable problem and analyze the worst-case performance of the algorithm for the general, as well as a special, case of the problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
1.4K
Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times
Alper Hamzadayi,Gokalp Yildiz +1 more
TL;DR: The results of the computational experiments indicate that the proposed GA is generally more effective and efficient in solving this problem when it is compared to the proposed MILP model, SA, SPT and LPT.
70
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
Mi-Yi Kim,Young Hoon Lee +1 more
TL;DR: The hybrid heuristic algorithm is developed for the practical use, which can yield a near-optimal schedule in a reasonable computational time and is evaluated by comparing with the results of MIP models and heuristics appearing in the literature.
59
Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server
TL;DR: This paper addresses a scheduling problem on parallel dedicated machines in which the setup times are sequence-dependent and the setup operations are performed by a single server and a hybrid genetic algorithm is developed to solve the problem.
58
Complexity results for flow-shop problems with a single server
TL;DR: Flow-shop problems with a single server are generalizations of classical flow- shop problems where each operation must be loaded onto the corresponding machine, which takes a certain setup time.
51
References
•Book
Theory of scheduling
Richard W. Conway,William L. Maxwell,Louis W. Miller +2 more
- 01 Jan 1967
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
2.4K
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
1.4K
Parallel machine scheduling with a common server
TL;DR: This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, parallel machines, under a variety of assumptions about setup and processing times, and provides a mapping of the computational complexity of these problems.
146
Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times
Alper Hamzadayi,Gokalp Yildiz +1 more
TL;DR: The results of the computational experiments indicate that the proposed GA is generally more effective and efficient in solving this problem when it is compared to the proposed MILP model, SA, SPT and LPT.
70
Related Papers (5)
Barbara Simons
- 13 Oct 1980
Min-You Wu,Wei Shu +1 more
- 12 Jun 1996
Hak Du Kim,Jin Suk Kim +1 more
- 07 Dec 2003