Pages that link to "Item:Q908846"

The following pages link to A survey of results for sequencing problems with controllable processing times (Q908846):

Displaying 32 items.

• Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
• Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← 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)
• Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
• Two-machine open shop problem with controllable processing times (Q2467128) (← links)
• Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
• Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
• Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
• Scheduling in network flow shops (Q2564878) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times (Q2566700) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
• The fixed-charge shortest-path problem (Q2815469) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719) (← links)
• Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
• A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
• (Q3320091) (← links)
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
• Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption (Q4909020) (← links)
• Loading and scheduling for flexible manufacturing systems with controllable processing times (Q5058957) (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
• Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022) (← links)
• A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)