Single machine scheduling with delivery dates and cumulative payoffs
From MaRDI portal
Publication:2434318
DOI10.1007/s10951-012-0302-0zbMath1280.90069OpenAlexW2000425226MaRDI QIDQ2434318
Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0302-0
Related Items (7)
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Performance guarantees for a scheduling problem with common stepwise job payoffs ⋮ Finding efficient make-to-order production and batch delivery schedules ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single processor scheduling with job values depending on their completion times
- On the complexity of generalized due date scheduling problems
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Scheduling with Fixed Delivery Dates
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Single machine scheduling with delivery dates and cumulative payoffs