Pages that link to "Item:Q2018941"

The following pages link to Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941):

Displaying 12 items.

• An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
• Graph multi-coloring for a job scheduling application (Q1686066) (← links)
• Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs (Q1707666) (← links)
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
• A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime (Q2061131) (← links)
• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
• Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
• Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
• Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
• Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)