Minimizing makespan on a single batch processing machine with nonidentical job sizes
Work
Year: 2001
Type: article
Abstract: We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine ... more
Source: Naval Research Logistics (NRL)
Institutions Zhejiang University, Chinese University of Hong Kong, Texas A&M University, IBM (United States)
Cites: 14
Cited by: 109
Related to: 10
FWCI: 2.217
Citation percentile (by year/subfield): 97.88
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze