Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
Work
Year: 2023
Type: article
Abstract: <abstract><p>We study the problem of non-preemptively scheduling jobs from two agents on an unbounded serial-batch machine. Agents $ A $ and $ B $ have $ n_A $ and $ n_B $ jobs. The machin... more
Source: Networks and Heterogeneous Media
Authors Shuguang Li, Mingsong Li, M. Ijaz Khan
Institutions Shandong Institute of Business and Technology, Peking University, Lebanese American University
Cites: 18
Cited by: 1
Related to: 10
FWCI: 0.369
Citation percentile (by year/subfield): 60.68
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Sustainable Development Goal Decent work and economic growth
Open Access status: gold