Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
From MaRDI portal
Publication:6542459
DOI10.1007/S11590-023-02039-ZzbMATH Open1547.90081MaRDI QIDQ6542459
Xin-Na Geng, Ji-Bo Wang, Yifu Feng, Dan-Yang Lv
Publication date: 22 May 2024
Published in: Optimization Letters (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
- A single-machine scheduling with a truncated linear deterioration and ready times
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- Single machine group scheduling with time dependent processing times and ready times
- Models and algorithms of time-dependent scheduling
- Scheduling jobs under simple linear deterioration
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Scheduling jobs with general truncated learning effects including proportional setup times
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Bicriterion scheduling with group technology and deterioration effect
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- Resource allocation flowshop scheduling with learning effect and slack due window assignment
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Resource dependent scheduling with truncated learning effects
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Reducibility among Combinatorial Problems
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Permutation flowshop scheduling with simple linear deterioration
- Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
- Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
- Multitasking scheduling with multiple rate‐modifying activities
- Research on m‐machine flow shop scheduling with truncated learning effects
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
Related Items (2)
A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function ⋮ Supply chain scheduling with deteriorating jobs and delivery times
This page was built for publication: Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542459)
