Minimizing makespan with release times on identical parallel batching machines

Shuguang Li; Guojun Li; Shaoqiang Zhang

doi:10.1016/j.dam.2004.11.004

ScienceGate Book Chapters

JOURNAL ARTICLE

Minimizing makespan with release times on identical parallel batching machines

Shuguang Li Guojun Li Shaoqiang Zhang

Year: 2005 Journal: Discrete Applied Mathematics Vol: 148 (1)Pages: 127-134 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2004.11.004

Get Full-Text PDF Get Analytical Report

Keywords:

Job shop scheduling Scheduling (production processes) Time complexity Batch processing Mathematical optimization Job scheduler Computer science Process (computing) Mathematics Parallel computing Algorithm Computer network Operating system Schedule

Metrics

Cited By

4.97

FWCI (Field Weighted Citation Impact)

Refs

0.94

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

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Minimizing makespan with release times on identical parallel batching machines

Metrics

Citation History

Topics

Related Documents

Minimizing makespan with release times on identical parallel batching machines

Minimizing Makespan on Identical Parallel Machines

Minimizing Makespan on Identical Parallel Machines

Minimizing makespan on a single batching machine with release times and non-identical job sizes

Minimizing Makespan with Chain Precedence Constraints on Identical Parallel Machines