Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
From MaRDI portal
Publication:2459400
DOI10.1016/j.cor.2006.09.027zbMath1211.90067OpenAlexW1990982167MaRDI QIDQ2459400
Xiaolin Xu, Yongbo Xiao, Jian Chen, Xiaoqiang Cai
Publication date: 6 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.027
production planningstochastic schedulingperishable productdeadlineproduct selectionmachine time allocation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The selection and scheduling of textile orders with due dates
- Job selection and sequencing on a single machine in a random environment
- The nonlinear knapsack problem - algorithms and applications
- Scheduling with batching: A review
- Minimizing tardy jobs in a flowshop with common due date
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- Optimal project selection: Stochastic knapsack with finite time horizon
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline