Pages that link to "Item:Q2638926"

The following pages link to Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date (Q2638926):

Displaying 34 items.

• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
• Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs (Q1268191) (← links)
• \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← links)
• Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date (Q1310010) (← links)
• Due window scheduling for parallel machines (Q1341402) (← links)
• Earliness-tardiness scheduling problems with a common delivery window (Q1342083) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
• On the fixed interval due-date scheduling problem (Q1917349) (← links)
• The weighted common due date single machine scheduling problem revisited (Q1919202) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
• Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date (Q2638926) (← links)
• Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties (Q2942667) (← links)
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
• Scheduling of storage/retrieval orders under a just-in-time environment (Q4399129) (← links)
• Single-machine scheduling with a common due window (Q5926034) (← links)
• Single machine weighted earliness-tardiness penalty problem with a common due date (Q5939971) (← links)
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167) (← links)
• Parallel machine scheduling with a common due window (Q5953340) (← links)