Parallel-machine scheduling in shared manufacturing
From MaRDI portal
Publication:2076469
DOI10.3934/JIMO.2020174zbMATH Open1499.90076OpenAlexW3112452868MaRDI QIDQ2076469FDOQ2076469
Authors: Min Ji, Xinna Ye, Fangyao Qian, Yiwei Jiang, T. C. Edwin Cheng 
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
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A survey on offline scheduling with rejection
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Parallel machine scheduling with nested processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job rejection
- Single-machine batch scheduling of linear deteriorating jobs
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
Cited In (4)
- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
- Scheduling Parallel Manufacturing Cells with Resource Flexibility
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)
