Scheduling unit length jobs with parallel nested machine processing set restrictions
From MaRDI portal
Publication:2566928
Recommendations
- Parallel machine scheduling with nested processing set restrictions
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Preemptive scheduling algorithms with nested processing set restriction
- Parallel batch scheduling with nested processing set restrictions
- Scheduling unit-length jobs with machine eligibility restrictions
Cites work
- A class of generalized multiprocessor scheduling problems
- Analysis of scheduling problems with typed task systems
- Complexity of scheduling problems with multi-purpose machines
- Effective neighbourhood functions for the flexible job shop problem
- scientific article; zbMATH DE number 3860868 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1033260 (Why is no real title available?)
- Linear-Time Algorithms for Scheduling on Parallel Processors
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Network flows. Theory, algorithms, and applications.
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- UET-scheduling with constrained processor allocations
Cited in
(25)- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Multipurpose machine scheduling with rejection and identical job processing times
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Online scheduling with equal processing times and machine eligibility constraints
- Parallel machine scheduling with nested job assignment restrictions
- Scheduling equal length jobs with eligibility restrictions
- Parallel batch scheduling with nested processing set restrictions
- Parallel machine problems with equal processing times: a survey
- Scheduling unit-length jobs with machine eligibility restrictions
- Parallel machine scheduling with nested processing set restrictions
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- scientific article; zbMATH DE number 5669900 (Why is no real title available?)
- Preemptive scheduling algorithms with nested processing set restriction
- Fast approximation algorithms for job scheduling with processing set restrictions
- scientific article; zbMATH DE number 2044495 (Why is no real title available?)
- Parallel machine scheduling with job assignment restrictions
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Matching with sizes (or scheduling with processing set restrictions)
- Matching with sizes (or scheduling with processing set restrictions)
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling unit length jobs on parallel machines with lookahead information
This page was built for publication: Scheduling unit length jobs with parallel nested machine processing set restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566928)
