Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
From MaRDI portal
(Redirected from Publication:941545)
Recommendations
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
Cites work
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A new sufficient condition of optimality for the two-machine flowshop problem
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments
- Flowshop scheduling research after five decades
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- Minimizing due date related performance measures on two batch processing machines
- Minimizing tardy jobs in a flowshop with common due date
- Minimizing total tardiness in permutation flowshops
- Multicriteria scheduling
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Scheduling Parallel Manufacturing Cells with Resource Flexibility
- Scheduling with controllable release dates and processing times: Makespan minimization
- Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- The impact of resource flexibility and staffing decisions on cellular and departmental shop performance
Cited in
(7)- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- The distributed no-idle permutation flowshop scheduling problem with due windows
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
This page was built for publication: Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941545)
