Pages that link to "Item:Q744645"
From MaRDI portal
The following pages link to Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645):
Displaying 18 items.
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Bounds for parallel machine scheduling with predefined parts of jobs and setup time (Q1708539) (← links)
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies (Q1789450) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs (Q2115759) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)
- Makespan Minimization with Machine Availability Constraints (Q3637090) (← links)
- Minimizing makespan for two parallel machines with job limit on each availability interval (Q5428993) (← links)
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664) (← links)
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection (Q6544919) (← links)
