Pages that link to "Item:Q2890462"
From MaRDI portal
The following pages link to An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems (Q2890462):
Displaying 16 items.
- Network construction problems with due dates (Q319443) (← links)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems (Q2393483) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts (Q6112585) (← links)