Pages that link to "Item:Q954933"

The following pages link to A scheduling problem with job values given as a power function of their completion times (Q954933):

Displaying 9 items.

• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
• A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
• A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← links)
• Single processor scheduling with job values depending on their completion times (Q880588) (← links)
• An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059) (← links)
• Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities (Q1762135) (← links)
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times (Q1788956) (← links)
• Single machine group scheduling with time and position dependent processing times (Q2448214) (← links)
• A Problem of Scheduling Jobs with Non-Monotonic Stepwise Values (Q5262425) (← links)