Pages that link to "Item:Q1870002"

The following pages link to On scheduling an unbounded batch machine (Q1870002):

Displaying 24 items.

• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
• Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
• On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
• Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
• Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
• Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
• Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• A note on special optimal batching structures to minimize total weighted completion time (Q2426655) (← links)
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877) (← links)
• Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
• Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)