Pages that link to "Item:Q297182"
From MaRDI portal
The following pages link to The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182):
Displayed 17 items.
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types (Q276548) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Regular scheduling measures on proportionate flowshop with job rejection (Q2307854) (← links)
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval (Q2346517) (← links)
- Scheduling with release times and rejection on two parallel machines (Q2359797) (← links)
- Minmax scheduling problems with common due-date and completion time penalty (Q2424794) (← links)
- Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)
- Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities (Q5059237) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
