Pages that link to "Item:Q1193720"
From MaRDI portal
The following pages link to Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720):
Displayed 36 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages (Q342190) (← links)
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times (Q941536) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Efficient heuristics to minimize total flow time with release dates (Q1195875) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)