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

Johnny C. Ho; Francisco J. López; Alex J. Ruiz‐Torres; Tzu-Liang Tseng

doi:10.1007/s10845-009-0270-1

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Johnny C. Ho Francisco J. López Alex J. Ruiz‐Torres Tzu-Liang Tseng

Year: 2009 Journal: Journal of Intelligent Manufacturing Vol: 22 (2)Pages: 179-190 Publisher: Springer Science+Business Media

DOI: 10.1007/s10845-009-0270-1

Get Full-Text PDF Get Analytical Report

Keywords:

Job shop scheduling Mathematical optimization Integer programming Schedule Scheduling (production processes) Computer science Set (abstract data type) Heuristic Linear programming Mathematics

Metrics

Cited By

1.57

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Assembly Line Balancing Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

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

Metrics

Citation History

Topics

Related Documents

Minimizing makespan subject to minimum flowtime on two identical parallel machines

Minimizing flowtime subject to optimal makespan on two identical parallel machines

Minimizing makespan subject to minimum total flow-time on identical parallel machines

Makespan minimization subject to flowtime optimality on identical parallel machines

Minimizing makespan subject to minimum total absolute deviation of completion time on identical parallel machines