Job selection in a heavily loaded shop

DOI10.1016/S0305-0548(96)00045-7MaRDI QIDQ1373892zbMATH OpenFDO

Authors Jay B. Ghosh

Publication date 1997

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

Full work available at URL https://doi.org/10.1016/S0305-0548(96)00045-7

zbMATH Keywords

branch-and-boundheavily loaded shopjob selectionNP-hardpseudo-polynomial time algorithms

Mathematics Subject Classification ID

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

Recommendations

• Selecting jobs for heavily loaded shop with lateness penalties
• Scheduling a two-stage flowshop under makespan constraint
• Job selection and sequencing on a single machine in a random environment
• Scheduling job shop problems with operators with respect to the maximum lateness

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Job selection and sequencing on a single machine in a random environment
• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• Selecting jobs for heavily loaded shop with lateness penalties

Cited in

(24)

• Order acceptance using genetic algorithms
• Multi-period job selection: Planning work loads to maximize profit
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
• Exact methods for order acceptance and scheduling on unrelated parallel machines
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• Order acceptance for motorail transportation with uncertain parameters
• 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
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• Order acceptance and scheduling with machine availability constraints
• Selecting jobs for heavily loaded shop with lateness penalties
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• A survey on offline scheduling with rejection
• 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
• An artificial bee colony based hyper-heuristic for the single machine order acceptance and scheduling problem
• Greedy solutions of selection and ordering problems
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Minimizing maximum delivery completion time for order scheduling with rejection
• A hybrid policy for order acceptance in batch process industries
• Order acceptance with weighted tardiness

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)