Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

DOI10.1016/j.cor.2012.07.013zbMath1349.90329OpenAlexW2108340887MaRDI QIDQ339589

Shan-Ci Liao, Wen-Chiung Lee, Yu-Hsiang Chung, Cheng, T. C. Edwin

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.013

zbMATH Keywords

schedulingmaximum latenesstotal weighted completion timetwo agents

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ A lower bound for minimizing the total completion time of a three-agent scheduling problem ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Two-agent vehicle scheduling problem on a line-shaped network ⋮ A note on two-agent scheduling with resource dependent release times on a single machine ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent scheduling on a single machine with release dates

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A single-machine scheduling problem with two-agent and deteriorating jobs
• A two-machine flowshop problem with two agents
• A note on the scheduling with two families of jobs
• Scheduling two agents with controllable processing times
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling with release dates on a single machine to minimize total weighted completion time
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Competitive Two-Agent Scheduling and Its Applications
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
• Scheduling Problems with Two Competing Agents
• Single machine sequencing with linear models of release dates

This page was built for publication: Two-agent singe-machine scheduling with release times to minimize the total weighted completion time