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

DOI10.1016/J.TCS.2014.05.022zbMATH Open1360.90122OpenAlexW1994742500MaRDI QIDQ2250441FDOQ2250441

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

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
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work

zbMATH Keywords

complexityschedulingcompeting agentsjust-in-time job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (15)

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

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)