Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness

Abstract

In this paper, we consider the following single machine online tradeoff scheduling problem. A set of n independent jobs arrive online over time. Each job J j has a release date r j , a processing time p j and a delivery time q j . The characteristics of a job are unknown until it arrives. The goal is to find a schedule that minimizes the makespan C max = max 1≤ j≤n C j and the maximum lateness L max = max 1≤ j≤n L j , where L j = C j + q j . For the problem, we present a nondominated (ρ, 1 + 1 ρ )-competitive online algorithm for each ρ with 1 ≤ ρ ≤ √ 5 + 1 2 .

Online Bi-Criteria Scheduling on Batch Machines with Machine Costs

“…In recent years, there have been some results about minimizing bi-criteria objective functions such as Ma et al [15], who considered an online trade-off scheduling problem that minimize makespan and total weighted completion time on a single machine, presenting a nondominated (1 + α, 1 + 1 α )−competitive online algorithm for each α with 0 < α ≤ 1. Liu et al [16] considered the single machine online trade-off scheduling problem, which minimizes the makespan and maximum lateness. They established a nondominated (ρ…”