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

DOI10.1016/J.TCS.2014.05.022MaRDI QIDQ2250441zbMATH OpenOpenAlexFDO

Authors Byung-Cheon Choi, Jibok Chung

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)

Recommendations

• A just-in-time scheduling problem with two competing agents
• Single machine just‐in‐time scheduling problems with two competing agents
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• scientific article; zbMATH DE number 6531341
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work

Cites work

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

Cited in

(15)

• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
• Pareto-scheduling of two competing agents with their own equal processing times
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
• scientific article; zbMATH DE number 7113489 (Why is no real title available?)
• A just-in-time scheduling problem with two competing agents
• Single machine scheduling with two competing agents and equal job processing times
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Single machine just‐in‐time scheduling problems with two competing agents
• scientific article; zbMATH DE number 6531341 (Why is no real title available?)
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
• A two-agent single-machine scheduling problem with late work criteria
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250441)