Pages that link to "Item:Q1600949"

The following pages link to A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949):

Displaying 50 items.

• Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity (Q1634141) (← links)
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)
• An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
• A note on a due-date assignment on a two-machine flow-shop (Q1765554) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← 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)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
• Common due date scheduling with autonomous and induced learning (Q1887957) (← links)
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
• Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
• Single-machine scheduling with upper bounded maintenance time under the deteriorating effect (Q1956114) (← links)
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
• Due date assignment scheduling with positional-dependent weights and proportional setup times (Q2086881) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times (Q2142501) (← links)
• A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• A note on the single machine CON and CONW problems with lot scheduling (Q2230735) (← links)
• Minmax due-date assignment on a two-machine flowshop (Q2241579) (← links)
• Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
• Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
• Scheduling jobs with position and sum-of-processing-time based processing times (Q2278782) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← 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)
• Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
• Trading off due-date tightness and job tardiness in a basic scheduling model (Q2356123) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance (Q2379661) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Minmax scheduling problems with common due-date and completion time penalty (Q2424794) (← links)
• Improving delivery reliability by a new due-date setting rule (Q2426550) (← links)
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
• Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
• Optimal due-date assignment problem with learning effect and resource-dependent processing times (Q2439495) (← links)
• Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity (Q2448206) (← links)