Parallel-machine scheduling in shared manufacturing
From MaRDI portal
Cites work
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A survey on offline scheduling with rejection
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Parallel machine scheduling with nested processing set restrictions
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Scheduling parallel machines with inclusive processing set restrictions and job rejection
- Single-machine batch scheduling of linear deteriorating jobs
Cited in
(5)- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
- Scheduling Parallel Manufacturing Cells with Resource Flexibility
- Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Production coordination of local and cloud orders in shared manufacturing: a bi-objective pre-scheduling approach
This page was built for publication: Parallel-machine scheduling in shared manufacturing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076469)
