Non-permutation flow shop scheduling with order acceptance and weighted tardiness
From MaRDI portal
Publication:670790
DOI10.1016/j.amc.2015.08.011zbMath1410.90098OpenAlexW2054000633MaRDI QIDQ670790
Yingying Yuan, Abdullah Konak, Ren-Qian Zhang, Yi-Yong Xiao
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.08.011
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- 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
- Scheduling linear deteriorating jobs with rejection on a single machine
- A due-date assignment problem with learning effect and deteriorating jobs
- Order acceptance using genetic algorithms
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Permutation vs. non-permutation flow shop schedules
- A new constructive heuristic for the flowshop scheduling problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
- 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
- Towards intelligent manufacturing planning and control systems
- Two-machine flow-shop scheduling with rejection
- Workload based order acceptance in job shop environments
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- 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
- Selecting jobs for heavily loaded shop with lateness penalties
- Optimal two- and three-stage production schedules with setup times included
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Preemptive multiprocessor scheduling with rejection
