Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
From MaRDI portal
Publication:1010295
DOI10.1016/J.COR.2008.09.012zbMath1179.90158OpenAlexW2088778450MaRDI QIDQ1010295
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.012
Related Items (16)
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects ⋮ Scheduling identical jobs on uniform parallel machines under position-based learning effects ⋮ A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty ⋮ A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs ⋮ Scheduling problems with general effects of deterioration and learning ⋮ Due date single machine scheduling problems with nonlinear deterioration and learning effects and past sequence dependent setup times ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ An uncertain parallel machine problem with deterioration and learning effect
Uses Software
Cites Work
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine and two-machine flowshop scheduling with general learning functions
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Single-machine scheduling with learning considerations
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Parallel machine earliness and tardiness scheduling with proportional weights
- Scheduling with general job-dependent learning curves.
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Work allocation to stations with varying learning slopes and without buffers
- Minimizing total tardiness in a scheduling problem with a learning effect
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Optimal allocation of work in assembly lines for lots with homogeneous learning
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling Deteriorating Jobs on a Single Processor
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Due-date assignment and single machine scheduling with deteriorating jobs
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Λ-Shaped Policies to Schedule Deteriorating Jobs
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Scheduling problems with a learning effect
- Single machine weighted earliness-tardiness penalty problem with a common due date
This page was built for publication: Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
