Makespan minimization subject to flowtime optimality on identical parallel machines

Chien‐Hung Lin; Ching‐Jong Liao

doi:10.1016/s0305-0548(03)00113-8

ScienceGate Book Chapters

JOURNAL ARTICLE

Makespan minimization subject to flowtime optimality on identical parallel machines

Chien‐Hung Lin Ching‐Jong Liao

Year: 2003 Journal: Computers & Operations Research Vol: 31 (10)Pages: 1655-1666 Publisher: Elsevier BV

DOI: 10.1016/s0305-0548(03)00113-8

Get Full-Text PDF Get Analytical Report

Keywords:

Job shop scheduling Mathematical optimization Minification Computational complexity theory Upper and lower bounds Computer science Mathematics Algorithm Schedule

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.19

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

Makespan minimization subject to flowtime optimality on identical parallel machines

Metrics

Citation History

Topics

Related Documents

Minimizing flowtime subject to optimal makespan on two identical parallel machines

Minimizing makespan subject to minimum flowtime on two identical parallel machines

On the Minimization of the Makespan Subject to Flowtime Optimality

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

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