Pages that link to "Item:Q2430605"

The following pages link to A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605):

Displaying 11 items.

• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
• Time-optimal control in a single machine problem with resource constraints (Q1086143) (← links)
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
• Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production (Q2295326) (← links)
• Throughput optimization for the Robotic Cell Problem with Controllable Processing Times (Q4603940) (← links)
• Slack due window assignment scheduling in the single-machine with controllable processing times (Q6065132) (← links)
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment (Q6635995) (← links)