Permutation flow shop scheduling with order acceptance and weighted tardiness
From MaRDI portal
Publication:419558
DOI10.1016/j.amc.2012.01.073zbMath1237.90101OpenAlexW4247518366MaRDI QIDQ419558
Ikou Kaku, Ren-Qian Zhang, Yi-Yong Xiao, Qiu Hong Zhao
Publication date: 18 May 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.01.073
Related Items (11)
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 ⋮ 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 ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A note on permutation flow shop problem
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- A hybrid policy for order acceptance in batch process industries
- Order acceptance with weighted tardiness
- On-line scheduling with rejection on identical parallel machines
- Single-machine scheduling under the job rejection constraint
- A due-date assignment problem with learning effect and deteriorating jobs
- Order acceptance using genetic algorithms
- Permutation vs. non-permutation flow shop schedules
- Job selection and sequencing on a single machine in a random environment
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- A concise survey of scheduling with time-dependent processing times
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Workload based order acceptance in job shop environments
- A computational study of the permutation flow shop problem based on a tight lower bound
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Selecting jobs for scheduling on a machine subject to failure
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Online scheduling with machine cost and rejection
- Selecting jobs for heavily loaded shop with lateness penalties
- Optimal two- and three-stage production schedules with setup times included
- Minimizing Total Tardiness on One Machine is NP-Hard
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Techniques for scheduling with rejection
- Equation of State Calculations by Fast Computing Machines
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Permutation flow shop scheduling with order acceptance and weighted tardiness
