scholarly journals Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine

2013 ◽  
Vol 41 (2) ◽  
pp. 121-125 ◽  
Author(s):  
James M. Davis ◽  
Rajiv Gandhi ◽  
Vijay H. Kothari
Keyword(s):  
Single Machine ◽  
Weighted Sum ◽  
Combinatorial Algorithms ◽  
Completion Times ◽  
Sum Of Completion Times

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance

2019 ◽  
Vol 75 (1) ◽  
pp. 291-320 ◽  
Author(s):  
Hanane Krim ◽  
Rachid Benmansour ◽  
David Duvivier ◽  
Daoud Aït-Kadi ◽  
Said Hanafi
Keyword(s):  
Single Machine ◽  
Weighted Sum ◽  
Scheduling Problem ◽  
Periodic Maintenance ◽  
Completion Times ◽  
Sum Of Completion Times

scholarly journals Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

2021 ◽  
Author(s):  
Hanane Krim ◽  
Nicolas Zufferey ◽  
Jean-Yves Potvin ◽  
Rachid Benmansour ◽  
David Duvivier
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Mixed Integer ◽  
Weighted Sum ◽  
Scheduling Problem ◽  
Maintenance Policy ◽  
Mixed Integer Linear Program ◽  
Job Rejection ◽  
Completion Times ◽  
Sum Of Completion Times

AbstractWe consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

scholarly journals Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Yong He ◽  
Li Sun
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Minimization Problems ◽  
Processing Times ◽  
Machine Group ◽  
Polynomially Solvable ◽  
Decreasing Functions ◽  
Completion Times ◽  
Sum Of Completion Times

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.

A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair

1988 ◽  
Vol 2 (1) ◽  
pp. 41-49 ◽  
Author(s):  
Michael Pinedo ◽  
Elias Rammouz
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Stochastic Scheduling ◽  
Weighted Sum ◽  
Due Dates ◽  
Objective Functions ◽  
Weighted Number ◽  
Number Of Late Jobs ◽  
Late Jobs ◽  
Completion Times

This paper considers a single machine and n jobs. The machine is subject to breakdown and repair. Job j has a weight wj, a random processing time Xj, and is available for processing from a random time Rj on. The jobs may be subject to precedence constraints. We are interested in optimal policies that minimize the following objective functions: (i) the weighted sum of the completion times; (ii) the weighted sum of an exponential function of the completion times; and (iii) the weighted number of late jobs having due dates.

Sign in / Sign up

Export Citation Format

Share Document