Pages that link to "Item:Q1173904"
From MaRDI portal
The following pages link to Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904):
Displayed 16 items.
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← 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)
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
- Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
- Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain (Q2463495) (← links)
- Due-date assignment on uniform machines (Q2519077) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties (Q5936755) (← links)
- Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)