Simple matching vs linear assignment in scheduling models with positional effects: a critical review
From MaRDI portal
Publication:1926950
DOI10.1016/j.ejor.2012.04.037zbMath1253.90117OpenAlexW2074235891MaRDI QIDQ1926950
Kabir Rustogi, Vitaly A. Strusevich
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.037
Related Items
Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity, Parallel-machine scheduling with maintenance: praising the assignment problem, Scheduling a deteriorating maintenance activity and due-window assignment, Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations, Single machine group scheduling with position dependent processing times and ready times, Single machine scheduling with a generalized job-dependent cumulative effect, Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects, Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine, Resource constrained scheduling with general truncated job-dependent learning effect, Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine, On interactive sequencing situations with exponential cost functions, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times, Single-machine scheduling problems with machine aging effect and an optional maintenance activity, A unified analysis for scheduling problems with variable processing times, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects, An FPTAS of minimizing total weighted completion time on single machine with position constraint, An Optimal Online Algorithm for Scheduling with Learning Consideration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Some single-machine scheduling problems with general effects of learning and deterioration
- A note on scheduling deteriorating jobs
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Single machine scheduling with past-sequence-dependent setup times and learning effects
- Time-dependent scheduling
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- A survey of variants and extensions of the resource-constrained project scheduling problem
- A note on single-machine scheduling with job-dependent learning effects
- Single machine scheduling and due date assignment with positionally dependent processing times
- Single-machine scheduling problems with a learning effect
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Single-machine scheduling with learning considerations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A concise survey of scheduling with time-dependent processing times
- Scheduling with general job-dependent learning curves.
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Single-machine scheduling with both deterioration and learning effects
- A survey of scheduling with controllable processing times
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- Two-machine flow shop no-wait scheduling with machine maintenance
- A comment on scheduling two parallel machines with capacity constraints
- Scheduling Problems with Learning and Ageing Effects: A Survey
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Assignment Problems
- Scheduling a deteriorating maintenance activity on a single machine
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Scheduling independent tasks to reduce mean finishing time
- A note on scheduling problems with learning effect and deteriorating jobs
- An extension of the Munkres algorithm for the assignment problem to rectangular matrices
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling problems with a learning effect
