Pages that link to "Item:Q1373892"
From MaRDI portal
The following pages link to Job selection in a heavily loaded shop (Q1373892):
Displaying 22 items.
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations (Q418059) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- A hybrid policy for order acceptance in batch process industries (Q850653) (← links)
- Order acceptance with weighted tardiness (Q878579) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- Multi-period job selection: Planning work loads to maximize profit (Q1348559) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
- Order acceptance for motorail transportation with uncertain parameters (Q2018112) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem (Q4613886) (← links)
- Greedy solutions of selection and ordering problems (Q5945209) (← links)