Scheduling fully parallel jobs with integer units

DOI10.1007/978-981-96-4445-2_22MaRDI QIDQ6909229zbMATH OpenFDO

Authors Junyi Zhang, Juan Zou, Ming-Yu Ma

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_22

zbMATH Keywords

fully parallel jobsidentical machinesinteger parallel unitspolynomial-time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• scientific article; zbMATH DE number 167292 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Integer preemptive scheduling on parallel machines
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with splitting jobs
• Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
• Preemptive parallel-machine scheduling with a common server to minimize makespan
• Reducibility among combinatorial problems
• Scheduling fully parallel jobs

This page was built for publication: Scheduling fully parallel jobs with integer units

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909229)