Two-agent single-machine scheduling problem with just-in-time jobs

DOI10.1016/j.tcs.2014.05.022zbMath1360.90122OpenAlexW1994742500MaRDI QIDQ2250441

Ji-Bok Chung, Byung-Cheon Choi

Publication date: 7 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.022

zbMATH Keywords

complexityschedulingcompeting agentsjust-in-time job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Pareto-scheduling of two competing agents with their own equal processing times ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks

Cites Work

• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Single machine scheduling to minimize the number of early and tardy jobs
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• 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
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Scheduling Problems with Two Competing Agents
• Rescheduling for New Orders
• Approximation Schemes for the Restricted Shortest Path Problem
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

This page was built for publication: Two-agent single-machine scheduling problem with just-in-time jobs