A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
From MaRDI portal
Publication:2012897
DOI10.1007/S10878-016-0049-1zbMATH Open1377.90033OpenAlexW2469632011MaRDI QIDQ2012897FDOQ2012897
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
Recommendations
- scientific article
- Two-agent single-machine scheduling with assignable due dates
- A survey of due-date related single-machine with two-agent scheduling problem
- Two-agent scheduling in a flowshop
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent single-machine scheduling problem with just-in-time jobs
- Two-agent scheduling on a single sequential and compatible batching machine
- Two-agent single machine scheduling problem with the total weighted early work
- A single-machine bi-criterion scheduling problem with two agents
- Approximation schemes for two-machine flow shop scheduling with two agents
Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47)
Cites Work
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A multiple-criterion model for machine scheduling
- Multi-agent single machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Multiagent Scheduling
- Unbounded parallel-batching scheduling with two competitive agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single machine just‐in‐time scheduling problems with two competing agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single machine common flow allowance scheduling with controllable processing times
- Title not available (Why is that?)
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- Single Machine Scheduling with Flow Allowances
- Solving a two-agent single-machine scheduling problem considering learning effect
- Due-date assignment on uniform machines
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Approximation schemes for two-machine flow shop scheduling with two agents
- Minmax scheduling with job-classes and earliness-tardiness costs
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
Cited In (13)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Scheduling two projects with controllable processing times in a single-machine environment
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- A survey of due-date related single-machine with two-agent scheduling problem
- A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect
- A note on the single machine CON and CONW problems with lot scheduling
- A new perspective on single-machine scheduling problems with late work related criteria
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Two-agent single-machine scheduling with release dates to minimize the makespan
- 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
This page was built for publication: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012897)
