A Lagrangian approach to single-machine scheduling problems with two competing agents

DOI10.1007/s10951-008-0098-0zbMath1185.90063OpenAlexW1980489469MaRDI QIDQ2268518

Dario Pacciarelli, Alessandro Agnetis, Gianluca De Pascale

Publication date: 8 March 2010

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0098-0

zbMATH Keywords

Lagrangian relaxationsingle-machine schedulingbranch-and-boundmulti-agent scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ A scheduling problem with three competing agents ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ Scheduling problems with two competing agents to minimize minmax and minsum earliness measures ⋮ A two-machine flowshop problem with two agents ⋮ Two-agent scheduling on a single machine with release dates ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS ⋮ Vehicle scheduling problems with two agents on a line

Cites Work

• An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• 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 scheduling on a single machine to minimize total weighted number of tardy jobs
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Scheduling Problems with Two Competing Agents
• Minimizing Weighted Completion Times with Deadlines