Pages that link to "Item:Q924160"
From MaRDI portal
The following pages link to The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160):
Displayed 24 items.
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← 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)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Two-machine flow-shop scheduling with rejection (Q1762086) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- Scheduling with release times and rejection on two parallel machines (Q2359797) (← links)
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times (Q2438395) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- Single Machine Scheduling with an Availability Constraint and Rejection (Q2931173) (← links)
- Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects (Q5265454) (← links)
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION (Q5411726) (← links)