Minmax common due-window assignment scheduling with deteriorating jobs
From MaRDI portal
Publication:6601968
DOI10.1007/S40305-023-00511-2MaRDI QIDQ6601968
Jing Xue, Dan-Yang Lv, Ji-Bo Wang
Publication date: 11 September 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Isomorphic scheduling problems
- Models and algorithms of time-dependent scheduling
- Minmax scheduling problems with a common due-window
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Complexity of scheduling with proportional deterioration and release dates
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
- The due date assignment scheduling problem with the deteriorating jobs and delivery time
- Production, maintenance and resource scheduling: a review
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Due date-related scheduling with two agents. Models and algorithms
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A survey on scheduling problems with due windows
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Common due window size and location determination in a single machine scheduling problem
- Multiagent Scheduling
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
- A Due-Window Determination In Minmax Scheduling Problems
- Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
Related Items (4)
A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function ⋮ Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations ⋮ Supply chain scheduling with deteriorating jobs and delivery times ⋮ Permutation flow shop scheduling with makespan objective and truncated learning effects
This page was built for publication: Minmax common due-window assignment scheduling with deteriorating jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601968)