Two parallel-machine scheduling problems with function constraint
From MaRDI portal
Publication:2187975
DOI10.1155/2020/2717095zbMath1459.90094OpenAlexW3024742626MaRDI QIDQ2187975
Publication date: 3 June 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/2717095
Related Items (1)
Cites Work
- Unnamed Item
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- A state-of-the-art review of parallel-machine scheduling research
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Minimizing the makespan on two identical parallel machines with mold constraints
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Parallel machine problems with equal processing times: a survey
- Parallel-machine scheduling with time dependent processing times
This page was built for publication: Two parallel-machine scheduling problems with function constraint