Selecting jobs for heavily loaded shop with lateness penalties

DOI10.1016/0305-0548(95)00015-EzbMath0871.90050OpenAlexW2042713767MaRDI QIDQ2563886

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

heuristic proceduresheavily loaded shopcriterion for time-related penaltiesweighted lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (26)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Multi-period job selection: Planning work loads to maximize profit ⋮ 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 hybrid policy for order acceptance in batch process industries ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Job selection in a heavily loaded shop ⋮ Order acceptance with weighted tardiness ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ 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 ⋮ RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. ⋮ 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 ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Order acceptance and scheduling with consideration of service level ⋮ Scheduling a two-stage flowshop under makespan constraint ⋮ 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 ⋮ A matheuristic for the generalized order acceptance and scheduling problem

Uses Software

• IMSL Numerical Libraries

Cites Work

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

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