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 46 items.

• Minmax due-date assignment with a time window for acceptable lead-times (Q2449349) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Real-time prediction of order flowtimes using support vector regression (Q2483499) (← links)
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
• Due-date assignment on uniform machines (Q2519077) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• Scheduling in supply chain environment (Q2643925) (← links)
• Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
• Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine. (Q2773167) (← links)
• Scheduling problems with a common due window assignment: a survey (Q2877536) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• Multicriteria models for just-in-time scheduling (Q2997893) (← links)
• Single machine due-date scheduling of jobs with decreasing start-time dependent processing times (Q3025050) (← links)
• Modelling and integration of customer flexibility in the order commitment process for high mix low volume production (Q3055257) (← links)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
• Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
• SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT (Q4626601) (← links)
• Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
• Real-time due-date promising by build-to-order environments (Q4671325) (← links)
• Proportionate flowshop scheduling with position-dependent weights (Q5059283) (← links)
• $k$-Fibonacci numbers and $k$-Lucas numbers and associated bipartite graphs (Q5102134) (← links)
• A fuzzy-neural knowledge-based system for job completion time prediction and internal due date assignment in a wafer fabrication plant (Q5168743) (← links)
• Due-date assignment for multi-server multi-stage assembly systems (Q5252913) (← links)
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs (Q5305562) (← links)
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)
• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs (Q6046632) (← links)
• A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights (Q6053517) (← links)
• Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects (Q6053522) (← links)
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (Q6164365) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
• Integrated production and transportation scheduling problem under nonlinear cost structures (Q6555171) (← links)
• New exact and heuristic algorithms for general production and delivery integration (Q6565384) (← links)
• Due-date assignment with acceptable lead-times on parallel machines (Q6568406) (← links)
• Self-adaptive biased differential evolution for scheduling against common due dates (Q6579091) (← links)
• Minmax common due-window assignment scheduling with deteriorating jobs (Q6601968) (← links)
• Scheduling a single machine with multiple due dates per job (Q6657886) (← links)