Scheduling identical parallel machines with machine eligibility restrictions to minimize total weighted flowtime in automobile gear manufacturing

2011 ◽  
Vol 60 (9-12) ◽  
pp. 1099-1110 ◽  
Author(s):  
Ravindra Gokhale ◽  
M. Mathirajan
Keyword(s):  
Parallel Machines ◽  
Identical Parallel Machines ◽  
Machine Eligibility ◽  
Gear Manufacturing ◽  
Weighted Flowtime

Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

2009 ◽  
Vol 22 (2) ◽  
pp. 179-190 ◽  
Author(s):  
Johnny C. Ho ◽  
Francisco J. López ◽  
Alex J. Ruiz-Torres ◽  
Tzu-Liang (Bill) Tseng
Keyword(s):  
Parallel Machines ◽  
Identical Parallel Machines ◽  
Minimum Makespan ◽  
Weighted Flowtime

scholarly journals A characterization of optimal multiprocessor schedules and new dominance rules

2020 ◽  
Vol 40 (4) ◽  
pp. 876-900
Author(s):  
Rico Walter ◽  
Alexander Lawrinenko
Keyword(s):  
Parallel Machines ◽  
Computational Study ◽  
Search Space ◽  
Point Of View ◽  
Theoretical Point ◽  
Optimal Solutions ◽  
Identical Parallel Machines ◽  
Makespan Minimization ◽  
Structural Pattern

Abstract The paper on hand approaches the classical makespan minimization problem on identical parallel machines from a rather theoretical point of view. Using an approach similar to the idea behind inverse optimization, we identify a general structural pattern of optimal multiprocessor schedules. We also show how to derive new dominance rules from the characteristics of optimal solutions. Results of our computational study attest to the efficacy of the new rules. They are particularly useful in limiting the search space when each machine processes only a few jobs on average.

scholarly journals Rescheduling Production on Identical Parallel Machines upon new jobs arrivals

2019 ◽  
Vol 52 (13) ◽  
pp. 2525-2530
Author(s):  
Nathália C.O. Silva ◽  
Cassius T. Scarpin ◽  
Angel Ruiz ◽  
José E. Pécora
Keyword(s):  
Parallel Machines ◽  
Identical Parallel Machines ◽  
New Jobs

SEMI-ONLINE MACHINE COVERING

2007 ◽  
Vol 24 (03) ◽  
pp. 373-382 ◽  
Author(s):  
SHENG-YI CAI
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Parallel Machines ◽  
Identical Parallel Machines ◽  
Processing Times ◽  
First Case ◽  
Machine Covering

This paper investigates two different semi-online versions of the machine covering, which is the problem of assigning a set of jobs to a system of m(m ≥ 3) identical parallel machines so as to maximize the earliest machine completion time. In the first case, we assume that the largest processing times is known in advance. In the second case, we assume that the total processing times of all jobs is known in advance. For each version we propose a semi-online algorithm and investigate its competitive ratio. The competitive ratio of each algorithm is [Formula: see text], which is shown to be the best possible competitive ratio for each semi-online problem.

Sign in / Sign up

Export Citation Format

Share Document