Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times

Abstract

In this study we address several two-agent problems in which the measure criterion is to minimize the maximum cost or total weighted completion of all the jobs, while subject to an upper bound on the maximum cost of agent A. In term of minimizing the maximum cost of all the jobs subject to an upper bound on the maximum cost of agent A, we discuss some optimal properties and propose polynomial time solution algorithm to solve it. In term of minimizing the total weighted completion of all the jobs subject to an upper bound on the maximum cost of agent A, we analyze the complexity, show that this problem is NP-hard, and discuss it under special cases. In addition, for minimizing the total weighted completion of all the jobs subject to an upper bound on the makespan of agent A, we derive some dominance rules to be used in a branch-and-bound method and propose a heuristic for finding the optimal and nearoptimal solution, respectively. A computational simulation is also provided to determine the performance of the proposed algorithms.

Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

“…Many scholars engaged in one-processor scheduling and parallel-processor scheduling research in the early stage [4][5][6][7][8], and many scholars are continuing research in this field [9][10][11][12][13][14][15]. Luo et al [16] studied the single-machine scheduling problem with job-dependent machine deterioration.…”

“…Constraint (10) indicates that an assembly task can be assembled by only one assembly workstation. Constraint (11) indicates that a single assembly workstation cannot assemble two assembly tasks simultaneously. Constraint (12) shows that the end assembly time of assembly task k on assembly workstation l is the sum of its start assembly time on assembly workstation l and its assembly time on assembly workstation l. Constraint (13) represents that decision variable S kl is a nonnegative continuous number.…”

A three-agent scheduling problem for minimizing the flow time on two machines

“…At the beginning of multi-agent scheduling, only two competing agents were considered. Even so, most of such problems are NP-hard (e.g., [5,49,56]). Consequently, the issues of two-agent scheduling have been widely and thoroughly discussed for decades.…”