A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
From MaRDI portal
Publication:2012897
Recommendations
- scientific article; zbMATH DE number 6531341
- 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
Cites work
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Approximation schemes for two-machine flow shop scheduling with two agents
- Competitive two-agent scheduling and its applications
- Due-date assignment on uniform machines
- Job-dependent due-window assignment based on a common flow allowance
- Minmax scheduling with job-classes and earliness-tardiness costs
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- Multi-agent single machine scheduling
- Multiagent scheduling. Models and algorithms
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Single Machine Scheduling with Flow Allowances
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Single machine common flow allowance scheduling with controllable processing times
- Single machine just‐in‐time scheduling problems with two competing agents
- Solving a two-agent single-machine scheduling problem considering learning effect
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Unbounded parallel-batching scheduling with two competitive agents
Cited in
(14)- Two-agent single-machine scheduling with assignable due dates
- 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
- 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
- A note on the single machine CON and CONW problems with lot scheduling
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- 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
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- Scheduling two projects with controllable processing times in a single-machine 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)
