Single machine just‐in‐time scheduling problems with two competing agents

DOI10.1002/nav.21562zbMath1411.90144OpenAlexW1895486958MaRDI QIDQ4632815

Enrique Gerstl, Gur Mosheiov

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21562

zbMATH Keywords

schedulingearliness-tardinesssingle-machinecommon due-datetwo-agentsmultiagents

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling with two competing agents to minimize total weighted earliness, Single machine scheduling with non-availability interval and optional job rejection, Scheduling with competing agents, total late work and job rejection, Two‐agent scheduling with linear resource‐dependent processing times, A survey of due-date related single-machine with two-agent scheduling problem, Two-agent single-machine scheduling with release dates to minimize the makespan, Two-agent vehicle scheduling problem on a line-shaped network, A two-agent single-machine scheduling problem to minimize the total cost with release dates, Scheduling two projects with controllable processing times in a single-machine environment, A just-in-time scheduling problem with two competing agents, A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance, Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria, Two-agent integrated scheduling of production and distribution operations with fixed departure times, Due date assignment and two-agent scheduling under multitasking environment