Pages that link to "Item:Q1208482"
From MaRDI portal
The following pages link to Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482):
Displaying 34 items.
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Rescheduling of identical parallel machines under machine eligibility constraints. (Q1399598) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures (Q1688445) (← links)
- Match-up scheduling under a machine breakdown (Q1806884) (← links)
- Single-machine scheduling with periodic maintenance and nonresumable jobs. (Q1868816) (← links)
- Total completion time minimization in a computer system with a server and two parallel processors (Q1886864) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan (Q2296256) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
- Min-Max partitioning problem with matroid constraint (Q2519447) (← links)
- Machine scheduling with an availability constraint (Q2564885) (← links)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION (Q3013566) (← links)
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- (Q4934199) (← links)
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
- (Q5702311) (← links)
- Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)
- Multitasking scheduling with shared processing (Q6537208) (← links)
