A two-agent single-machine scheduling problem with late work criteria

DOI10.1007/s00500-015-1900-5zbMath1381.90040OpenAlexW1821414104MaRDI QIDQ1701708

Chin-Chia Wu, Du-Juan Wang, Peng-Hsiang Hsu, Yau-Ren Shiau, Chao-Chung Kang

Publication date: 27 February 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-015-1900-5

zbMATH Keywords

branch-and-bound algorithmschedulingdynamic programmingtwo agents

Mathematics Subject Classification ID

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

Related Items

Pareto-scheduling of two competing agents with their own equal processing times, Two-machine flow-shop scheduling to minimize total late work: revisited, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, Scheduling with competing agents, total late work and job rejection, Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work, Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work, A survey of due-date related single-machine with two-agent scheduling problem, Single-machine preemptive scheduling with release dates involving the total weighted late work criterion, A note on a two-agent scheduling problem related to the total weighted late work, A new perspective on single-machine scheduling problems with late work related criteria, Single-machine scheduling with multi-agents to minimize total weighted late work, Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives, A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion, Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date, Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works, Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Two-agent single-machine scheduling problems under increasing linear deterioration
• Dominance relations for two-machine flow shop problem with late work criterion
• A two-machine flowshop problem with two agents
• Scheduling two agents with controllable processing times
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Approximation algorithms for scheduling a single machine to minimize total late work
• Open shop scheduling problems with late work criteria.
• Approximation schemes for two-agent scheduling on parallel machines
• Two-agent single-machine scheduling with assignable due dates
• 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
• Single-machine multi-agent scheduling problems with a global objective function
• Unbounded parallel-batching scheduling with two competitive agents
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• A multiple-criterion model for machine scheduling
• Coordination of production and transportation in supply chain scheduling
• Two-machine scheduling with periodic availability constraints to minimize makespan
• Competitive Two-Agent Scheduling and Its Applications
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Scheduling Problems with Two Competing Agents
• Single Machine Scheduling to Minimize Total Late Work
• Tabu Search—Part I