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

Jatinder N.D. Gupta; Alex J. Ruiz‐Torres

doi:10.1016/s0377-2217(99)00386-0

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Jatinder N.D. Gupta Alex J. Ruiz‐Torres

Year: 2000 Journal: European Journal of Operational Research Vol: 125 (2)Pages: 370-380 Publisher: Elsevier BV

DOI: 10.1016/s0377-2217(99)00386-0

Get Full-Text PDF Get Analytical Report

Keywords:

Job shop scheduling Mathematical optimization Computer science Scheduling (production processes) Maximum flow problem Heuristic Flow shop scheduling Mathematics Schedule

Metrics

Cited By

2.35

FWCI (Field Weighted Citation Impact)

Refs

0.87

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

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

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

Metrics

Citation History

Topics

Related Documents

MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME

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

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

Minimizing makespan subject to minimum flowtime on two identical parallel machines

Minimizing Makespan on Identical Parallel Machines