Scheduling jobs on parallel machines to minimize a regular step total cost function
From MaRDI portal
Publication:2434254
DOI10.1007/s10951-010-0203-zzbMath1280.90039OpenAlexW1986342377MaRDI QIDQ2434254
Stéphane Dauzère-Pérès, Claude Yugma, Boris Detienne
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-010-0203-z
Related Items
Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, An improved decision support model for scheduling production in an engineer-to-order manufacturer, Single machine scheduling with delivery dates and cumulative payoffs, Exact methods for order acceptance and scheduling on unrelated parallel machines, Performance guarantees for a scheduling problem with common stepwise job payoffs, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, A constraint generation approach for two-machine shop problems with jobs selection, Heuristics for a flowshop scheduling problem with stepwise job objective function, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty, Scheduling job families on non-identical parallel machines with time constraints, Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook
Cites Work
- The one-machine sequencing problem
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Minimizing the weighted number of tardy jobs on parallel processors
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Dominance-based heuristics for one-machine total cost scheduling problems
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Parallel Machine Scheduling by Column Generation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Planning and Scheduling in Manufacturing and Services
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
