A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

DOI10.1007/s10878-016-0049-1zbMath1377.90033OpenAlexW2469632011MaRDI QIDQ2012897

Baruch Mor, Gur Mosheiov

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0049-1

zbMATH Keywords

schedulingsingle machineminmaxtwo agentscommon flow-allowance

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect ⋮ 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 ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A note on the single machine CON and CONW problems with lot scheduling ⋮ Two-stage medical supply chain scheduling with an assignable common due window and shelf life ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time ⋮ Due date assignment and two-agent scheduling under multitasking environment

Cites Work

• Unnamed Item
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Minmax scheduling with job-classes and earliness-tardiness costs
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Solving a two-agent single-machine scheduling problem considering learning effect
• Approximation schemes for two-machine flow shop scheduling with two agents
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Unbounded parallel-batching scheduling with two competitive agents
• A multiple-criterion model for machine scheduling
• Multi-agent single machine scheduling
• Single machine common flow allowance scheduling with controllable processing times
• Due-date assignment on uniform machines
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Single machine just‐in‐time scheduling problems with two competing agents
• Multiagent Scheduling
• Single Machine Scheduling with Flow Allowances
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan

This page was built for publication: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance