Parallel-machine scheduling in shared manufacturing
From MaRDI portal
Publication:2076469
DOI10.3934/JIMO.2020174zbMath1499.90076OpenAlexW3112452868MaRDI QIDQ2076469
Xinna Ye, Min Ji, Yiwei Jiang, Fangyao Qian, Cheng, T. C. Edwin
Publication date: 16 February 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020174
Related Items (1)
Cites Work
- A survey on offline scheduling with rejection
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Single-machine batch scheduling of linear deteriorating jobs
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Parallel machine scheduling with nested processing set restrictions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling parallel machines with inclusive processing set restrictions and job rejection
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
This page was built for publication: Parallel-machine scheduling in shared manufacturing