Parallel-machine scheduling with non-simultaneous machine available time
From MaRDI portal
Publication:1667812
DOI10.1016/j.apm.2012.09.053zbMath1426.90138OpenAlexW2046874576MaRDI QIDQ1667812
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.053
Related Items (6)
Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ A new model and algorithm for uncertain random parallel machine scheduling problem ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
Cites Work
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Single-machine group scheduling with general deterioration and learning effects
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Parallel machines scheduling with nonsimultaneous machine available time
- A note on single-machine group scheduling problems with position-based learning effect
- A due-date assignment problem with learning effect and deteriorating jobs
- Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
- Single-machine scheduling with time-and-resource-dependent processing times
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Minimizing Variation of Flow Time in Single Machine Systems
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Parallel machine scheduling with a learning effect
This page was built for publication: Parallel-machine scheduling with non-simultaneous machine available time
