A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime

DOI10.1007/S10951-020-00672-5zbMath1479.90101OpenAlexW3093662638MaRDI QIDQ2061131

Kevin A. Bunn, José A. Ventura, Xin Li

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-020-00672-5

zbMATH Keywords

Lagrangian relaxationearliness and tardiness penaltiessingle-machine schedulingdynamic programminggenetic algorithmorder acceptanceovertime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

A survey of job shop scheduling problem: the types and models ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• 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
• Order acceptance with weighted tardiness
• Order acceptance using genetic algorithms
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Order acceptance and scheduling with machine availability constraints
• An exact algorithm for single-machine scheduling without machine idle time
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Sequencing with Earliness and Tardiness Penalties: A Review
• Overtime Scheduling: An Application in Finite-capacity Real-time Scheduling

This page was built for publication: A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime