Pages that link to "Item:Q1593519"

The following pages link to A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519):

Displaying 21 items.

• Max-plus-based mathematical formulation for cyclic permutation flow-shops (Q622825) (← links)
• A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations (Q1273121) (← links)
• Job-shop scheduling with convex models of operations (Q1341401) (← links)
• A variant of the permutation flow shop model with variable processing times (Q1363747) (← links)
• Diversity of processing times in permutation flow shop scheduling problems (Q2050279) (← links)
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Single-machine group scheduling with deteriorating jobs and allotted resource (Q2448141) (← links)
• Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
• Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
• SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719) (← links)
• (Q3818111) (← links)
• Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments (Q4006897) (← links)
• A note on scheduling jobs with missing operations in permutation flow shops (Q4245674) (← links)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
• Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343) (← links)
• Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment (Q6635995) (← links)