Pages that link to "Item:Q2446866"

The following pages link to A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'' (Q2446866):

Displaying 6 items.

• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
• A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
• Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)