Job selection in a heavily loaded shop
From MaRDI portal
Publication:1373892
DOI10.1016/S0305-0548(96)00045-7zbMATH Open0893.90089MaRDI QIDQ1373892FDOQ1373892
Authors: Jay B. Ghosh
Publication date: 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
Cited In (22)
- Order acceptance for motorail transportation with uncertain parameters
- Minimizing maximum delivery completion time for order scheduling with rejection
- A survey on offline scheduling with rejection
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Greedy solutions of selection and ordering problems
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- A hybrid policy for order acceptance in batch process industries
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Order acceptance with weighted tardiness
- Order acceptance using genetic algorithms
- An artificial bee colony based hyper-heuristic for the single machine order acceptance and scheduling problem
- Multi-period job selection: Planning work loads to maximize profit
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- A matheuristic for the generalized order acceptance and scheduling problem
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- Order acceptance and scheduling with machine availability constraints
This page was built for publication: Job selection in a heavily loaded shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373892)