Bicriteria multi-machine scheduling with equal processing times subject to release dates
From MaRDI portal
Publication:6145328
DOI10.3934/nhm.2023060OpenAlexW4378085805MaRDI QIDQ6145328
Zhimeng Liu, Unnamed Author, Shuguang Li, Muhammad Ijaz Khan, Sayed M. Eldin
Publication date: 2 February 2024
Published in: Networks and Heterogeneous Media (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/nhm.2023060
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding total unimodularity in optimization problems solved by linear programs
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- Makespan minimization subject to flowtime optimality on identical parallel machines
- Equal processing time bicriteria scheduling on parallel machines
- Torsion of differentials of hypersurfaces with isolated singularities
- Bi-objective parallel machine scheduling with additional resources during setups
- Scheduling equal length jobs with eligibility restrictions
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Parallel machine problems with equal processing times: a survey
- Multicriteria scheduling
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- A better algorithm for sequencing with release and delivery times on identical machines
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
This page was built for publication: Bicriteria multi-machine scheduling with equal processing times subject to release dates
