Pages that link to "Item:Q1765094"

The following pages link to Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094):

Displaying 26 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
• Range of lower bounds (Q648257) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)
• Scheduling job classes on uniform machines (Q1761112) (← links)
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
• Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← 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)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• Scheduling problems with a common due window assignment: A survey (Q2877536) (← links)
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
• Hierarchical production planning and scheduling in a multi-product, batch process environment (Q5444475) (← links)
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)