Job selection in a heavily loaded shop

DOI10.1016/S0305-0548(96)00045-7zbMath0893.90089MaRDI QIDQ1373892

Jay B. Ghosh

Publication date: 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundNP-hardpseudo-polynomial time algorithmsjob selectionheavily loaded shop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Multi-period job selection: Planning work loads to maximize profit ⋮ Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations ⋮ A hybrid policy for order acceptance in batch process industries ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Order acceptance with weighted tardiness ⋮ A survey on offline scheduling with rejection ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ 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 ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Greedy solutions of selection and ordering problems ⋮ Order acceptance for motorail transportation with uncertain parameters ⋮ Order acceptance using genetic algorithms ⋮ 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

Cites Work

• Job selection and sequencing on a single machine in a random environment
• Selecting jobs for heavily loaded shop with lateness penalties
• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• Unnamed Item
• Unnamed Item