Pages that link to "Item:Q5638123"

The following pages link to A hybrid algorithm for the one machine sequencing problem to minimize total tardiness (Q5638123):

Displaying 26 items.

• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
• An efficient job scheduling algorithm for mixed turnaround and deadline applications (Q1140986) (← links)
• Hybrid algorithm for sequencing with bicriteria (Q1162274) (← links)
• One machine scheduling to minimize expected mean tardiness. I (Q1184467) (← links)
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
• Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
• A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
• A heuristic for the single machine tardiness problem (Q1310015) (← links)
• The job shop tardiness problem: A decomposition approach (Q1310711) (← links)
• A greedy heuristic for the mean tardiness sequencing problem (Q1317079) (← links)
• One machine scheduling to minimize expected mean tardiness. II (Q1332812) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Decomposition of the single machine total tardiness problem (Q1362989) (← links)
• Solution of the single machine total tardiness problem (Q1592283) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• A decomposition algorithm for the single machine total tardiness problem (Q1838424) (← links)
• Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• Production problems with deadline penalties (Q3738897) (← links)
• A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem (Q4398985) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)