Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
From MaRDI portal
Publication:1667775
DOI10.1016/J.APM.2012.09.044zbMATH Open1426.90144OpenAlexW2006534204MaRDI QIDQ1667775FDOQ1667775
Publication date: 30 August 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.09.044
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Single-machine group scheduling with general deterioration and learning effects
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- Time-dependent scheduling
- A state-of-the-art review on scheduling with learning effects
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single-machine scheduling problems with past-sequence-dependent setup times
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Single machine scheduling with past-sequence-dependent setup times and learning effects
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with learning effect considerations
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with time-and-resource-dependent processing times
- Scheduling problems with learning and ageing effects: a survey
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Scheduling problems with general effects of deterioration and learning
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Single-machine and two-machine flowshop scheduling with general learning functions
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- A revision of some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- A revision of machine scheduling problems with a general learning effect
- Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
- Minimizing the total completion time in a single-machine scheduling problem with a learning effect
- Single machine multiple common due dates scheduling with learning effects
- Some single-machine scheduling problems with general effects of learning and deterioration
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Minimizing total tardiness in a scheduling problem with a learning effect
- A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
Cited In (13)
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
- Research on scheduling problems with general effects of deterioration and learning
- Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects
- Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
- Scheduling jobs with position and sum-of-processing-time based processing times
- The third comprehensive survey on scheduling problems with setup times/costs
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
- Scheduling jobs with general truncated learning effects including proportional setup times
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
- Due date assignment scheduling with positional-dependent weights and proportional setup times
- Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning
- Machine scheduling problems with a position-dependent deterioration
This page was built for publication: Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667775)