Selecting jobs for heavily loaded shop with lateness penalties

DOI10.1016/0305-0548(95)00015-EMaRDI QIDQ2563886zbMATH OpenOpenAlexFDO

Authors Susan A. Slotnick, Thomas E. Morton

Publication date 6 January 1997

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

Full work available at URL https://doi.org/10.1016/0305-0548(95)00015-e

zbMATH Keywords

criterion for time-related penaltiesheavily loaded shopheuristic proceduresweighted lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job selection in a heavily loaded shop
• Multi-period job selection: Planning work loads to maximize profit
• Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues

Cites work

• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• Survey of scheduling research involving due date determination decisions

Cited in

(30)

• Order acceptance using genetic algorithms
• Multi-period job selection: Planning work loads to maximize profit
• Job selection in a heavily loaded shop
• RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions.
• 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
• Order acceptance for motorail transportation with uncertain parameters
• 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
• Scheduling a two-stage flowshop under makespan constraint
• Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
• An improved heuristic for parallel machine scheduling with rejection
• Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
• A real-time order acceptance and scheduling approach for permutation flow shop problems
• 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
• Order acceptance and scheduling with consideration of service level
• 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
• Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Benders decompositions for order acceptance and scheduling in additive manufacturing
• 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

Describes a project that uses

Uses Software

• IMSL Numerical Libraries

This page was built for publication: Selecting jobs for heavily loaded shop with lateness penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563886)