Order acceptance and scheduling with machine availability constraints

DOI10.1016/j.ejor.2013.07.032zbMath1305.90208OpenAlexW1999685919MaRDI QIDQ2255964

Guoqing Wang, Xueling Zhong, Jinwen Ou

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.032

zbMATH Keywords

approximationjob rejectionorder acceptance and schedulingmachine availability constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling with release times and rejection on two parallel machines ⋮ Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Parallel machine scheduling with restricted job rejection ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time ⋮ Fixed interval scheduling with third‐party machines ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ Designs for Order-of-Addition Screening Experiments ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Order acceptance and scheduling with consideration of service level ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime ⋮ Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine ⋮ Joint client selection and contract design for a risk-averse commodity broker in a two-echelon supply chain ⋮ A matheuristic for the generalized order acceptance and scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
• A survey on offline scheduling with rejection
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
• Single-machine scheduling with periodic maintenance to minimize makespan
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Order acceptance with weighted tardiness
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Single-machine scheduling under the job rejection constraint
• Order acceptance using genetic algorithms
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• A new fully polynomial time approximation scheme for the Knapsack problem
• Job selection in a heavily loaded shop
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• Preemptive scheduling with rejection
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Scheduling with limited machine availability
• Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Selecting jobs for heavily loaded shop with lateness penalties
• Machine scheduling with an availability constraint
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Single machine scheduling with a restricted rate-modifying activity
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: Order acceptance and scheduling with machine availability constraints