Permutation flow shop scheduling with order acceptance and weighted tardiness
From MaRDI portal
(Redirected from Publication:419558)
Recommendations
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Order acceptance with weighted tardiness
- scientific article; zbMATH DE number 495273
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
Cites work
- A computational study of the permutation flow shop problem based on a tight lower bound
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- A concise survey of scheduling with time-dependent processing times
- A due-date assignment problem with learning effect and deteriorating jobs
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A hybrid policy for order acceptance in batch process industries
- A note on permutation flow shop problem
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 1670665 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Job selection and sequencing on a single machine in a random environment
- Job selection in a heavily loaded shop
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Multi-period job selection: Planning work loads to maximize profit
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- On-line scheduling with rejection on identical parallel machines
- Online scheduling with machine cost and rejection
- Optimal two- and three-stage production schedules with set-up time included
- Optimization by simulated annealing
- Order acceptance using genetic algorithms
- Order acceptance with weighted tardiness
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- Permutation vs. non-permutation flow shop schedules
- Preemptive multiprocessor scheduling with rejection
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Selecting jobs for heavily loaded shop with lateness penalties
- Selecting jobs for scheduling on a machine subject to failure
- Single-machine scheduling under the job rejection constraint
- Techniques for scheduling with rejection
- Workload based order acceptance in job shop environments
Cited in
(15)- Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
- Diversity controlling genetic algorithm for order acceptance and scheduling problem
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- Permutation flow shop scheduling with earliness and tardiness penalties
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- An artificial bee colony based hyper-heuristic for the single machine order acceptance and scheduling problem
- A single-machine bi-criterion scheduling problem with two agents
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Order acceptance with weighted tardiness
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
This page was built for publication: Permutation flow shop scheduling with order acceptance and weighted tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419558)
