Pages that link to "Item:Q4363720"
From MaRDI portal
The following pages link to Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs (Q4363720):
Displaying 30 items.
- A lower bound for weighted completion time variance (Q613431) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
- Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
- Improved heuristics for the early/tardy scheduling problem with no idle time (Q1886859) (← links)
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
- HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE (Q4286352) (← links)
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301) (← links)
- Multiple common due dates (Q4434513) (← links)
- An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs (Q4883157) (← links)
- Hierarchical production planning and scheduling in a multi-product, batch process environment (Q5444475) (← links)
- Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
- Parallel machine scheduling with a common due window (Q5953340) (← links)
- An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
